TSTP Solution File: GRP684-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP684-1 : 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 : n015.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:00 EDT 2022
% Result : Unsatisfiable 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP684-1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % 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 : n015.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 : Mon Jun 13 12:20:23 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: 8 Number of unprocessed: 8
% 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 # 8 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 8 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 0 extension rule candidate clauses
% 0.13/0.37 # 8 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 15 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 15 tableaux to operate on
% 0.19/0.52 # There were 1 total branch saturation attempts.
% 0.19/0.52 # There were 0 of these attempts blocked.
% 0.19/0.52 # There were 0 deferred branch saturation attempts.
% 0.19/0.52 # There were 0 free duplicated saturations.
% 0.19/0.52 # There were 1 total successful branch saturations.
% 0.19/0.52 # There were 0 successful branch saturations in interreduction.
% 0.19/0.52 # There were 0 successful branch saturations on the branch.
% 0.19/0.52 # There were 1 successful branch saturations after the branch.
% 0.19/0.52 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.52 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.52 # Begin clausification derivation
% 0.19/0.52
% 0.19/0.52 # End clausification derivation
% 0.19/0.52 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.52 cnf(i_0_9, plain, (ld(X1,mult(X1,X1))=X1)).
% 0.19/0.52 cnf(i_0_10, plain, (rd(mult(X1,X1),X1)=X1)).
% 0.19/0.52 cnf(i_0_11, plain, (ld(X1,mult(X1,X2))=mult(X1,ld(X1,X2)))).
% 0.19/0.52 cnf(i_0_12, plain, (rd(mult(X1,X2),X2)=mult(rd(X1,X2),X2))).
% 0.19/0.52 cnf(i_0_15, plain, (ld(X1,mult(X1,ld(X2,X2)))=rd(mult(rd(X1,X1),X2),X2))).
% 0.19/0.52 cnf(i_0_16, negated_conjecture, (rd(mult(a,mult(b,c)),mult(b,c))!=rd(mult(a,c),c))).
% 0.19/0.52 cnf(i_0_13, plain, (ld(ld(X1,X2),mult(ld(X1,X2),mult(X3,X4)))=mult(ld(X1,mult(X1,X3)),X4))).
% 0.19/0.52 cnf(i_0_14, plain, (rd(mult(mult(X1,X2),rd(X3,X4)),rd(X3,X4))=mult(X1,rd(mult(X2,X4),X4)))).
% 0.19/0.52 cnf(i_0_18, plain, (X5=X5)).
% 0.19/0.52 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.52 # Begin printing tableau
% 0.19/0.52 # Found 6 steps
% 0.19/0.52 cnf(i_0_9, plain, (ld(X5,mult(X5,X5))=X5), inference(start_rule)).
% 0.19/0.52 cnf(i_0_25, plain, (ld(X5,mult(X5,X5))=X5), inference(extension_rule, [i_0_22])).
% 0.19/0.52 cnf(i_0_42, plain, (ld(X3,mult(X3,X3))!=X3), inference(closure_rule, [i_0_9])).
% 0.19/0.52 cnf(i_0_41, plain, (mult(ld(X3,mult(X3,X3)),ld(X5,mult(X5,X5)))=mult(X3,X5)), inference(extension_rule, [i_0_21])).
% 0.19/0.52 cnf(i_0_56, plain, (mult(X3,X5)!=ld(mult(X3,X5),mult(mult(X3,X5),mult(X3,X5)))), inference(closure_rule, [i_0_9])).
% 0.19/0.52 cnf(i_0_54, plain, (mult(ld(X3,mult(X3,X3)),ld(X5,mult(X5,X5)))=ld(mult(X3,X5),mult(mult(X3,X5),mult(X3,X5)))), inference(etableau_closure_rule, [i_0_54, ...])).
% 0.19/0.52 # End printing tableau
% 0.19/0.52 # SZS output end
% 0.19/0.52 # Branches closed with saturation will be marked with an "s"
% 0.19/0.52 # Child (17896) has found a proof.
% 0.19/0.52
% 0.19/0.52 # Proof search is over...
% 0.19/0.52 # Freeing feature tree
%------------------------------------------------------------------------------