TSTP Solution File: PHI012+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PHI012+1 : TPTP v8.1.0. Released v7.2.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 : n026.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 : Mon Jul 18 16:45:35 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PHI012+1 : TPTP v8.1.0. Released v7.2.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.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 2 01:49:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.12/0.36 # and selection function SelectCQIPrecWNTNp.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 11 Number of unprocessed: 11
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 11 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 5 conjectures.
% 0.12/0.36 # There are 5 start rule candidates:
% 0.12/0.36 # Found 2 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 5 start rule tableaux created.
% 0.12/0.36 # 9 extension rule candidate clauses
% 0.12/0.36 # 2 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 5
% 0.12/0.36 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 19 tableaux to operate on
% 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 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_11, negated_conjecture, (object(esk2_0))).
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (exemplifies_property(none_greater,esk2_0))).
% 0.12/0.37 cnf(i_0_7, negated_conjecture, (esk3_1(X1)!=X1|~exemplifies_property(none_greater,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_9, negated_conjecture, (object(esk3_1(X1))|~exemplifies_property(none_greater,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_8, negated_conjecture, (exemplifies_property(none_greater,esk3_1(X1))|~exemplifies_property(none_greater,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_5, plain, (exemplifies_property(conceivable,X1)|~exemplifies_property(none_greater,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_3, plain, (exemplifies_property(none_greater,X1)|object(esk1_1(X1))|~exemplifies_property(conceivable,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_4, plain, (~exemplifies_relation(greater_than,X1,X2)|~exemplifies_property(none_greater,X2)|~exemplifies_property(conceivable,X1)|~object(X2)|~object(X1))).
% 0.12/0.37 cnf(i_0_1, plain, (exemplifies_property(conceivable,esk1_1(X1))|exemplifies_property(none_greater,X1)|~exemplifies_property(conceivable,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_2, plain, (exemplifies_relation(greater_than,esk1_1(X1),X1)|exemplifies_property(none_greater,X1)|~exemplifies_property(conceivable,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_6, plain, (X1=X2|exemplifies_relation(greater_than,X1,X2)|exemplifies_relation(greater_than,X2,X1)|~object(X2)|~object(X1))).
% 0.12/0.37 cnf(i_0_159, plain, (X11=X11)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 6 steps
% 0.12/0.37 cnf(i_0_159, plain, (esk2_0=esk2_0), inference(start_rule)).
% 0.12/0.37 cnf(i_0_202, plain, (esk2_0=esk2_0), inference(extension_rule, [i_0_163])).
% 0.12/0.37 cnf(i_0_246, plain, (~object(esk2_0)), inference(closure_rule, [i_0_11])).
% 0.12/0.37 cnf(i_0_244, plain, (object(esk2_0)), inference(extension_rule, [i_0_5])).
% 0.12/0.37 cnf(i_0_248, plain, (~exemplifies_property(none_greater,esk2_0)), inference(closure_rule, [i_0_10])).
% 0.12/0.37 cnf(i_0_247, plain, (exemplifies_property(conceivable,esk2_0)), inference(etableau_closure_rule, [i_0_247, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 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 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_11, negated_conjecture, (object(esk2_0))).
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (exemplifies_property(none_greater,esk2_0))).
% 0.12/0.37 cnf(i_0_7, negated_conjecture, (esk3_1(X1)!=X1|~exemplifies_property(none_greater,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_9, negated_conjecture, (object(esk3_1(X1))|~exemplifies_property(none_greater,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_8, negated_conjecture, (exemplifies_property(none_greater,esk3_1(X1))|~exemplifies_property(none_greater,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_5, plain, (exemplifies_property(conceivable,X1)|~exemplifies_property(none_greater,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_3, plain, (exemplifies_property(none_greater,X1)|object(esk1_1(X1))|~exemplifies_property(conceivable,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_4, plain, (~exemplifies_relation(greater_than,X1,X2)|~exemplifies_property(none_greater,X2)|~exemplifies_property(conceivable,X1)|~object(X2)|~object(X1))).
% 0.12/0.37 cnf(i_0_1, plain, (exemplifies_property(conceivable,esk1_1(X1))|exemplifies_property(none_greater,X1)|~exemplifies_property(conceivable,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_2, plain, (exemplifies_relation(greater_than,esk1_1(X1),X1)|exemplifies_property(none_greater,X1)|~exemplifies_property(conceivable,X1)|~object(X1))).
% 0.12/0.37 cnf(i_0_6, plain, (X1=X2|exemplifies_relation(greater_than,X1,X2)|exemplifies_relation(greater_than,X2,X1)|~object(X2)|~object(X1))).
% 0.12/0.37 cnf(i_0_159, plain, (X11=X11)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 6 steps
% 0.12/0.37 cnf(i_0_159, plain, (esk2_0=esk2_0), inference(start_rule)).
% 0.12/0.37 cnf(i_0_202, plain, (esk2_0=esk2_0), inference(extension_rule, [i_0_163])).
% 0.12/0.37 cnf(i_0_246, plain, (~object(esk2_0)), inference(closure_rule, [i_0_11])).
% 0.12/0.37 cnf(i_0_244, plain, (object(esk2_0)), inference(extension_rule, [i_0_5])).
% 0.12/0.37 cnf(i_0_248, plain, (~exemplifies_property(none_greater,esk2_0)), inference(closure_rule, [i_0_10])).
% 0.12/0.37 cnf(i_0_247, plain, (exemplifies_property(conceivable,esk2_0)), inference(etableau_closure_rule, [i_0_247, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Child (27390) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------