TSTP Solution File: GRP100-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP100-1 : TPTP v8.1.0. Bugfixed v2.7.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 : n006.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:04:24 EDT 2022
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP100-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.10/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.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 11:33:26 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.13/0.36 # and selection function SelectNewComplexAHP.
% 0.13/0.36 #
% 0.13/0.36 # Number of axioms: 3 Number of unprocessed: 3
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.20/0.48 # The folding up rule is enabled...
% 0.20/0.48 # Local unification is enabled...
% 0.20/0.48 # Any saturation attempts will use folding labels...
% 0.20/0.48 # 3 beginning clauses after preprocessing and clausification
% 0.20/0.48 # Creating start rules for all 1 conjectures.
% 0.20/0.48 # There are 1 start rule candidates:
% 0.20/0.48 # Found 2 unit axioms.
% 0.20/0.48 # 1 start rule tableaux created.
% 0.20/0.48 # 1 extension rule candidate clauses
% 0.20/0.48 # 2 unit axiom clauses
% 0.20/0.48
% 0.20/0.48 # Requested 8, 32 cores available to the main process.
% 0.20/0.48 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.48 # Creating equality axioms
% 0.20/0.48 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.48 # There were 1 total branch saturation attempts.
% 0.20/0.48 # There were 0 of these attempts blocked.
% 0.20/0.48 # There were 0 deferred branch saturation attempts.
% 0.20/0.48 # There were 0 free duplicated saturations.
% 0.20/0.48 # There were 1 total successful branch saturations.
% 0.20/0.48 # There were 0 successful branch saturations in interreduction.
% 0.20/0.48 # There were 0 successful branch saturations on the branch.
% 0.20/0.48 # There were 1 successful branch saturations after the branch.
% 0.20/0.48 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 # Begin clausification derivation
% 0.20/0.48
% 0.20/0.48 # End clausification derivation
% 0.20/0.48 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.48 cnf(i_0_9, plain, (double_divide(X1,double_divide(X1,identity))=identity)).
% 0.20/0.48 cnf(i_0_6, plain, (double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(X3,identity))),double_divide(identity,identity))=X2)).
% 0.20/0.48 cnf(i_0_10, negated_conjecture, (double_divide(double_divide(a2,identity),identity)!=a2|double_divide(double_divide(a1,double_divide(a1,identity)),identity)!=identity|double_divide(double_divide(a4,b4),identity)!=double_divide(double_divide(b4,a4),identity)|double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity)!=double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity))).
% 0.20/0.48 cnf(i_0_31, plain, (X4=X4)).
% 0.20/0.48 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.48 # Begin printing tableau
% 0.20/0.48 # Found 6 steps
% 0.20/0.48 cnf(i_0_9, plain, (double_divide(X8,double_divide(X8,identity))=identity), inference(start_rule)).
% 0.20/0.48 cnf(i_0_36, plain, (double_divide(X8,double_divide(X8,identity))=identity), inference(extension_rule, [i_0_35])).
% 0.20/0.48 cnf(i_0_55, plain, (double_divide(X9,double_divide(X9,identity))!=identity), inference(closure_rule, [i_0_9])).
% 0.20/0.48 cnf(i_0_54, plain, (double_divide(double_divide(X9,double_divide(X9,identity)),double_divide(X8,double_divide(X8,identity)))=double_divide(identity,identity)), inference(extension_rule, [i_0_34])).
% 0.20/0.48 cnf(i_0_67, plain, (double_divide(identity,identity)!=double_divide(double_divide(X1,double_divide(double_divide(double_divide(identity,identity),double_divide(X1,X3)),double_divide(X3,identity))),double_divide(identity,identity))), inference(closure_rule, [i_0_6])).
% 0.20/0.48 cnf(i_0_65, plain, (double_divide(double_divide(X9,double_divide(X9,identity)),double_divide(X8,double_divide(X8,identity)))=double_divide(double_divide(X1,double_divide(double_divide(double_divide(identity,identity),double_divide(X1,X3)),double_divide(X3,identity))),double_divide(identity,identity))), inference(etableau_closure_rule, [i_0_65, ...])).
% 0.20/0.48 # End printing tableau
% 0.20/0.48 # SZS output end
% 0.20/0.48 # Branches closed with saturation will be marked with an "s"
% 0.20/0.48 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.48 # We now have 8 tableaux to operate on
% 0.20/0.48 # Found closed tableau during pool population.
% 0.20/0.48 # Proof search is over...
% 0.20/0.48 # Freeing feature tree
%------------------------------------------------------------------------------