TSTP Solution File: GRP660-14 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP660-14 : 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 : n012.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 8.15s 1.43s
% Output : CNFRefutation 8.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP660-14 : TPTP v8.1.0. Released v8.1.0.
% 0.03/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 : n012.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 : Mon Jun 13 23:03:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.36 # No SInE strategy applied
% 0.19/0.36 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.19/0.36 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.19/0.36 #
% 0.19/0.36 # Number of axioms: 6 Number of unprocessed: 6
% 0.19/0.36 # Tableaux proof search.
% 0.19/0.36 # APR header successfully linked.
% 0.19/0.36 # Hello from C++
% 0.19/0.36 # The folding up rule is enabled...
% 0.19/0.36 # Local unification is enabled...
% 0.19/0.36 # Any saturation attempts will use folding labels...
% 0.19/0.36 # 6 beginning clauses after preprocessing and clausification
% 0.19/0.36 # Creating start rules for all 1 conjectures.
% 0.19/0.36 # There are 1 start rule candidates:
% 0.19/0.36 # Found 6 unit axioms.
% 0.19/0.36 # 1 start rule tableaux created.
% 0.19/0.36 # 0 extension rule candidate clauses
% 0.19/0.36 # 6 unit axiom clauses
% 0.19/0.36
% 0.19/0.36 # Requested 8, 32 cores available to the main process.
% 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.36 # Creating equality axioms
% 0.19/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.36 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.36 # We now have 13 tableaux to operate on
% 8.15/1.43 # There were 1 total branch saturation attempts.
% 8.15/1.43 # There were 0 of these attempts blocked.
% 8.15/1.43 # There were 0 deferred branch saturation attempts.
% 8.15/1.43 # There were 0 free duplicated saturations.
% 8.15/1.43 # There were 1 total successful branch saturations.
% 8.15/1.43 # There were 0 successful branch saturations in interreduction.
% 8.15/1.43 # There were 0 successful branch saturations on the branch.
% 8.15/1.43 # There were 1 successful branch saturations after the branch.
% 8.15/1.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.15/1.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.15/1.43 # Begin clausification derivation
% 8.15/1.43
% 8.15/1.43 # End clausification derivation
% 8.15/1.43 # Begin listing active clauses obtained from FOF to CNF conversion
% 8.15/1.43 cnf(i_0_8, plain, (ld(X1,mult(X1,X2))=X2)).
% 8.15/1.43 cnf(i_0_7, plain, (mult(X1,ld(X1,X2))=X2)).
% 8.15/1.43 cnf(i_0_9, plain, (mult(rd(X1,X2),X2)=X1)).
% 8.15/1.43 cnf(i_0_10, plain, (rd(mult(X1,X2),X2)=X1)).
% 8.15/1.43 cnf(i_0_12, negated_conjecture, (mult(ld(x1,x1),x0)!=x0)).
% 8.15/1.43 cnf(i_0_11, plain, (mult(mult(mult(X1,X2),X3),X1)=mult(X1,mult(X2,mult(X3,X1))))).
% 8.15/1.43 cnf(i_0_14, plain, (X4=X4)).
% 8.15/1.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 8.15/1.43 # Begin printing tableau
% 8.15/1.43 # Found 6 steps
% 8.15/1.43 cnf(i_0_8, plain, (ld(X11,mult(X11,X3))=X3), inference(start_rule)).
% 8.15/1.43 cnf(i_0_21, plain, (ld(X11,mult(X11,X3))=X3), inference(extension_rule, [i_0_18])).
% 8.15/1.43 cnf(i_0_37, plain, (ld(X3,mult(X3,mult(X3,X8)))!=mult(X3,X8)), inference(closure_rule, [i_0_8])).
% 8.15/1.43 cnf(i_0_35, plain, (ld(ld(X11,mult(X11,X3)),ld(X3,mult(X3,mult(X3,X8))))=ld(X3,mult(X3,X8))), inference(extension_rule, [i_0_17])).
% 8.15/1.43 cnf(i_0_50, plain, (ld(X3,mult(X3,X8))!=X8), inference(closure_rule, [i_0_8])).
% 8.15/1.43 cnf(i_0_48, plain, (ld(ld(X11,mult(X11,X3)),ld(X3,mult(X3,mult(X3,X8))))=X8), inference(etableau_closure_rule, [i_0_48, ...])).
% 8.15/1.43 # End printing tableau
% 8.15/1.43 # SZS output end
% 8.15/1.43 # Branches closed with saturation will be marked with an "s"
% 8.15/1.44 # Child (25765) has found a proof.
% 8.15/1.44
% 8.15/1.44 # Proof search is over...
% 8.15/1.44 # Freeing feature tree
%------------------------------------------------------------------------------