TSTP Solution File: GRP501-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP501-1 : TPTP v8.1.0. Released v2.6.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:06:45 EDT 2022
% Result : Unsatisfiable 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP501-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/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.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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:08:57 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 2 Number of unprocessed: 2
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.22/0.49 # The folding up rule is enabled...
% 0.22/0.49 # Local unification is enabled...
% 0.22/0.49 # Any saturation attempts will use folding labels...
% 0.22/0.49 # 2 beginning clauses after preprocessing and clausification
% 0.22/0.49 # Creating start rules for all 1 conjectures.
% 0.22/0.49 # There are 1 start rule candidates:
% 0.22/0.49 # Found 2 unit axioms.
% 0.22/0.49 # 1 start rule tableaux created.
% 0.22/0.49 # 0 extension rule candidate clauses
% 0.22/0.49 # 2 unit axiom clauses
% 0.22/0.49
% 0.22/0.49 # Requested 8, 32 cores available to the main process.
% 0.22/0.49 # There are not enough tableaux to fork, creating more from the initial 1
% 0.22/0.49 # Creating equality axioms
% 0.22/0.49 # Ran out of tableaux, making start rules for all clauses
% 0.22/0.50 # There were 1 total branch saturation attempts.
% 0.22/0.50 # There were 0 of these attempts blocked.
% 0.22/0.50 # There were 0 deferred branch saturation attempts.
% 0.22/0.50 # There were 0 free duplicated saturations.
% 0.22/0.50 # There were 1 total successful branch saturations.
% 0.22/0.50 # There were 0 successful branch saturations in interreduction.
% 0.22/0.50 # There were 0 successful branch saturations on the branch.
% 0.22/0.50 # There were 1 successful branch saturations after the branch.
% 0.22/0.50 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.50 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.50 # Begin clausification derivation
% 0.22/0.50
% 0.22/0.50 # End clausification derivation
% 0.22/0.50 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.50 cnf(i_0_4, plain, (double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X3))),double_divide(X4,double_divide(X2,X4)))))=X3)).
% 0.22/0.50 cnf(i_0_6, negated_conjecture, (inverse(double_divide(inverse(double_divide(c3,b3)),a3))!=inverse(double_divide(c3,inverse(double_divide(b3,a3)))))).
% 0.22/0.50 cnf(i_0_8, plain, (X5=X5)).
% 0.22/0.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.50 # Begin printing tableau
% 0.22/0.50 # Found 6 steps
% 0.22/0.50 cnf(i_0_4, plain, (double_divide(inverse(X11),inverse(double_divide(inverse(double_divide(X11,double_divide(X12,inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X10))),double_divide(X4,double_divide(X2,X4))))))),double_divide(X13,double_divide(X12,X13)))))=inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X10))),double_divide(X4,double_divide(X2,X4))))), inference(start_rule)).
% 0.22/0.50 cnf(i_0_14, plain, (double_divide(inverse(X11),inverse(double_divide(inverse(double_divide(X11,double_divide(X12,inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X10))),double_divide(X4,double_divide(X2,X4))))))),double_divide(X13,double_divide(X12,X13)))))=inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X10))),double_divide(X4,double_divide(X2,X4))))), inference(extension_rule, [i_0_13])).
% 0.22/0.50 cnf(i_0_27, plain, (double_divide(inverse(X21),inverse(double_divide(inverse(double_divide(X21,double_divide(X18,inverse(X1)))),double_divide(X16,double_divide(X18,X16)))))!=inverse(X1)), inference(closure_rule, [i_0_4])).
% 0.22/0.50 cnf(i_0_26, plain, (double_divide(double_divide(inverse(X21),inverse(double_divide(inverse(double_divide(X21,double_divide(X18,inverse(X1)))),double_divide(X16,double_divide(X18,X16))))),double_divide(inverse(X11),inverse(double_divide(inverse(double_divide(X11,double_divide(X12,inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X10))),double_divide(X4,double_divide(X2,X4))))))),double_divide(X13,double_divide(X12,X13))))))=double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X10))),double_divide(X4,double_divide(X2,X4)))))), inference(extension_rule, [i_0_11])).
% 0.22/0.50 cnf(i_0_35, plain, (double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X10))),double_divide(X4,double_divide(X2,X4)))))!=X10), inference(closure_rule, [i_0_4])).
% 0.22/0.50 cnf(i_0_33, plain, (double_divide(double_divide(inverse(X21),inverse(double_divide(inverse(double_divide(X21,double_divide(X18,inverse(X1)))),double_divide(X16,double_divide(X18,X16))))),double_divide(inverse(X11),inverse(double_divide(inverse(double_divide(X11,double_divide(X12,inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X10))),double_divide(X4,double_divide(X2,X4))))))),double_divide(X13,double_divide(X12,X13))))))=X10), inference(etableau_closure_rule, [i_0_33, ...])).
% 0.22/0.50 # End printing tableau
% 0.22/0.50 # SZS output end
% 0.22/0.50 # Branches closed with saturation will be marked with an "s"
% 0.22/0.50 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.22/0.50 # We now have 7 tableaux to operate on
% 0.22/0.50 # Found closed tableau during pool population.
% 0.22/0.50 # Proof search is over...
% 0.22/0.50 # Freeing feature tree
%------------------------------------------------------------------------------