TSTP Solution File: GRP660-11 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP660-11 : TPTP v8.1.0. Released v8.1.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 : n027.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:07:48 EDT 2022
% Result : Unsatisfiable 5.80s 1.11s
% Output : CNFRefutation 5.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP660-11 : TPTP v8.1.0. Released v8.1.0.
% 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 00:24:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.13/0.37 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Number of axioms: 6 Number of unprocessed: 6
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 6 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 1 conjectures.
% 0.13/0.37 # There are 1 start rule candidates:
% 0.13/0.37 # Found 6 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 0 extension rule candidate clauses
% 0.13/0.37 # 6 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 13 tableaux to operate on
% 5.80/1.11 # There were 1 total branch saturation attempts.
% 5.80/1.11 # There were 0 of these attempts blocked.
% 5.80/1.11 # There were 0 deferred branch saturation attempts.
% 5.80/1.11 # There were 0 free duplicated saturations.
% 5.80/1.11 # There were 1 total successful branch saturations.
% 5.80/1.11 # There were 0 successful branch saturations in interreduction.
% 5.80/1.11 # There were 0 successful branch saturations on the branch.
% 5.80/1.11 # There were 1 successful branch saturations after the branch.
% 5.80/1.11 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.80/1.11 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.80/1.11 # Begin clausification derivation
% 5.80/1.11
% 5.80/1.11 # End clausification derivation
% 5.80/1.11 # Begin listing active clauses obtained from FOF to CNF conversion
% 5.80/1.11 cnf(i_0_8, plain, (ld(X1,mult(X1,X2))=X2)).
% 5.80/1.11 cnf(i_0_7, plain, (mult(X1,ld(X1,X2))=X2)).
% 5.80/1.11 cnf(i_0_9, plain, (mult(rd(X1,X2),X2)=X1)).
% 5.80/1.11 cnf(i_0_10, plain, (rd(mult(X1,X2),X2)=X1)).
% 5.80/1.11 cnf(i_0_12, negated_conjecture, (mult(x0,rd(x1,x1))!=x0)).
% 5.80/1.11 cnf(i_0_11, plain, (mult(mult(mult(X1,X2),X3),X1)=mult(X1,mult(X2,mult(X3,X1))))).
% 5.80/1.11 cnf(i_0_14, plain, (X4=X4)).
% 5.80/1.11 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 5.80/1.11 # Begin printing tableau
% 5.80/1.11 # Found 6 steps
% 5.80/1.11 cnf(i_0_8, plain, (ld(X11,mult(X11,x0))=x0), inference(start_rule)).
% 5.80/1.11 cnf(i_0_21, plain, (ld(X11,mult(X11,x0))=x0), inference(extension_rule, [i_0_17])).
% 5.80/1.11 cnf(i_0_32, plain, (mult(x0,rd(x1,x1))=x0), inference(closure_rule, [i_0_12])).
% 5.80/1.11 cnf(i_0_33, plain, (mult(x0,rd(x1,x1))!=ld(X11,mult(X11,x0))), inference(extension_rule, [i_0_17])).
% 5.80/1.11 cnf(i_0_49, plain, (mult(x0,rd(x1,x1))!=ld(X1,mult(X1,mult(x0,rd(x1,x1))))), inference(closure_rule, [i_0_8])).
% 5.80/1.11 cnf(i_0_50, plain, (ld(X1,mult(X1,mult(x0,rd(x1,x1))))!=ld(X11,mult(X11,x0))), inference(etableau_closure_rule, [i_0_50, ...])).
% 5.80/1.11 # End printing tableau
% 5.80/1.11 # SZS output end
% 5.80/1.11 # Branches closed with saturation will be marked with an "s"
% 5.80/1.12 # Child (22316) has found a proof.
% 5.80/1.12
% 5.80/1.12 # Proof search is over...
% 5.80/1.12 # Freeing feature tree
%------------------------------------------------------------------------------