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