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