TSTP Solution File: GRP748-3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP748-3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 09:08:18 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GRP748-3 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 06:15:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C02AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 12 Number of unprocessed: 12
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 12 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 11 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 1 extension rule candidate clauses
% 0.12/0.36 # 11 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 19 tableaux to operate on
% 0.19/0.42 # There were 1 total branch saturation attempts.
% 0.19/0.42 # There were 0 of these attempts blocked.
% 0.19/0.42 # There were 0 deferred branch saturation attempts.
% 0.19/0.42 # There were 0 free duplicated saturations.
% 0.19/0.42 # There were 1 total successful branch saturations.
% 0.19/0.42 # There were 0 successful branch saturations in interreduction.
% 0.19/0.42 # There were 0 successful branch saturations on the branch.
% 0.19/0.42 # There were 1 successful branch saturations after the branch.
% 0.19/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.42 # Begin clausification derivation
% 0.19/0.42
% 0.19/0.42 # End clausification derivation
% 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.42 cnf(i_0_17, plain, (mult(X1,unit)=X1)).
% 0.19/0.42 cnf(i_0_18, plain, (mult(unit,X1)=X1)).
% 0.19/0.42 cnf(i_0_21, plain, (mult(X1,i(X1))=unit)).
% 0.19/0.42 cnf(i_0_22, plain, (mult(i(X1),X1)=unit)).
% 0.19/0.42 cnf(i_0_14, plain, (ld(X1,mult(X1,X2))=X2)).
% 0.19/0.42 cnf(i_0_13, plain, (mult(X1,ld(X1,X2))=X2)).
% 0.19/0.42 cnf(i_0_15, plain, (mult(rd(X1,X2),X2)=X1)).
% 0.19/0.42 cnf(i_0_16, plain, (rd(mult(X1,X2),X2)=X1)).
% 0.19/0.42 cnf(i_0_20, plain, (mult(mult(X1,X2),i(X2))=X1)).
% 0.19/0.42 cnf(i_0_19, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(mult(X2,X3),X2)))).
% 0.19/0.42 cnf(i_0_24, negated_conjecture, (mult(a,mult(mult(b,c),b))!=mult(a,mult(b,mult(c,b))))).
% 0.19/0.42 cnf(i_0_23, plain, (mult(i(X1),mult(X1,X2))=X2|mult(X1,X2)=mult(X2,X1))).
% 0.19/0.42 cnf(i_0_28, plain, (X4=X4)).
% 0.19/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.42 # Begin printing tableau
% 0.19/0.42 # Found 5 steps
% 0.19/0.42 cnf(i_0_17, plain, (mult(X3,unit)=X3), inference(start_rule)).
% 0.19/0.42 cnf(i_0_36, plain, (mult(X3,unit)=X3), inference(extension_rule, [i_0_35])).
% 0.19/0.42 cnf(i_0_68, plain, (i(mult(X3,unit))=i(X3)), inference(extension_rule, [i_0_32])).
% 0.19/0.42 cnf(i_0_81, plain, (mult(X5,unit)!=X5), inference(closure_rule, [i_0_17])).
% 0.19/0.42 cnf(i_0_79, plain, (ld(i(mult(X3,unit)),mult(X5,unit))=ld(i(X3),X5)), inference(etableau_closure_rule, [i_0_79, ...])).
% 0.19/0.42 # End printing tableau
% 0.19/0.42 # SZS output end
% 0.19/0.42 # Branches closed with saturation will be marked with an "s"
% 0.19/0.42 # Child (496) has found a proof.
% 0.19/0.42
% 0.19/0.42 # Proof search is over...
% 0.19/0.42 # Freeing feature tree
%------------------------------------------------------------------------------