TSTP Solution File: PHI015+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PHI015+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 : n029.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.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PHI015+1 : TPTP v8.1.0. Released v7.2.0.
% 0.06/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 : n029.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 : Thu Jun 2 01:20:46 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 38 Number of unprocessed: 38
% 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 # 38 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 4 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 34 extension rule candidate clauses
% 0.13/0.37 # 4 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.20/0.38 # There were 3 total branch saturation attempts.
% 0.20/0.38 # There were 0 of these attempts blocked.
% 0.20/0.38 # There were 0 deferred branch saturation attempts.
% 0.20/0.38 # There were 0 free duplicated saturations.
% 0.20/0.38 # There were 3 total successful branch saturations.
% 0.20/0.38 # There were 0 successful branch saturations in interreduction.
% 0.20/0.38 # There were 0 successful branch saturations on the branch.
% 0.20/0.38 # There were 3 successful branch saturations after the branch.
% 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.38 # Begin clausification derivation
% 0.20/0.38
% 0.20/0.38 # End clausification derivation
% 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.38 cnf(i_0_33, plain, (object(esk6_0))).
% 0.20/0.38 cnf(i_0_32, plain, (exemplifies_property(none_greater,esk6_0))).
% 0.20/0.38 cnf(i_0_37, plain, (is_the(god,none_greater))).
% 0.20/0.38 cnf(i_0_38, negated_conjecture, (~exemplifies_property(existence,god))).
% 0.20/0.38 cnf(i_0_1, plain, (~property(X1)|~object(X1))).
% 0.20/0.38 cnf(i_0_2, plain, (object(X1)|~exemplifies_property(X2,X1))).
% 0.20/0.38 cnf(i_0_4, plain, (object(X1)|~is_the(X1,X2))).
% 0.20/0.38 cnf(i_0_5, plain, (property(X1)|~is_the(X2,X1))).
% 0.20/0.38 cnf(i_0_3, plain, (property(X1)|~exemplifies_property(X1,X2))).
% 0.20/0.38 cnf(i_0_31, plain, (exemplifies_property(conceivable,X1)|~exemplifies_property(none_greater,X1))).
% 0.20/0.38 cnf(i_0_30, plain, (~exemplifies_relation(greater_than,X1,X2)|~exemplifies_property(none_greater,X2)|~exemplifies_property(conceivable,X1))).
% 0.20/0.38 cnf(i_0_36, plain, (exemplifies_property(existence,X1)|object(esk7_1(X1))|~is_the(X1,none_greater))).
% 0.20/0.38 cnf(i_0_34, plain, (exemplifies_property(conceivable,esk7_1(X1))|exemplifies_property(existence,X1)|~is_the(X1,none_greater))).
% 0.20/0.38 cnf(i_0_29, plain, (exemplifies_property(none_greater,X1)|object(esk5_1(X1))|~exemplifies_property(conceivable,X1))).
% 0.20/0.38 cnf(i_0_27, plain, (exemplifies_property(conceivable,esk5_1(X1))|exemplifies_property(none_greater,X1)|~exemplifies_property(conceivable,X1))).
% 0.20/0.38 cnf(i_0_35, plain, (exemplifies_relation(greater_than,esk7_1(X1),X1)|exemplifies_property(existence,X1)|~is_the(X1,none_greater))).
% 0.20/0.38 cnf(i_0_28, plain, (exemplifies_relation(greater_than,esk5_1(X1),X1)|exemplifies_property(none_greater,X1)|~exemplifies_property(conceivable,X1))).
% 0.20/0.38 cnf(i_0_15, plain, (object(esk1_3(X1,X2,X3))|~is_the(X3,X1)|~exemplifies_property(X2,X3))).
% 0.20/0.38 cnf(i_0_26, plain, (X1=X2|exemplifies_relation(greater_than,X1,X2)|exemplifies_relation(greater_than,X2,X1)|~object(X2)|~object(X1))).
% 0.20/0.38 cnf(i_0_22, plain, (esk3_3(X1,X2,X2)=X2|~is_the(X2,X1))).
% 0.20/0.38 cnf(i_0_25, plain, (object(esk3_3(X1,X2,X2))|~is_the(X2,X1))).
% 0.20/0.38 cnf(i_0_16, plain, (X1=X2|esk4_4(X3,X1,X2,X2)!=X2|~exemplifies_property(X3,X2)|~object(X1))).
% 0.20/0.38 cnf(i_0_17, plain, (is_the(X1,X2)|esk4_4(X2,X1,X3,X3)!=X3|~exemplifies_property(X2,X3)|~object(X1))).
% 0.20/0.38 cnf(i_0_23, plain, (X1=esk3_3(X2,X3,X3)|~is_the(X3,X2)|~exemplifies_property(X2,X1))).
% 0.20/0.38 cnf(i_0_6, plain, (exemplifies_property(X1,X2)|esk2_4(X3,X1,X2,X4)!=X4|~exemplifies_property(X3,X4)|~exemplifies_property(X1,X4)|~object(X2))).
% 0.20/0.38 cnf(i_0_7, plain, (is_the(X1,X2)|esk2_4(X2,X3,X1,X4)!=X4|~exemplifies_property(X3,X4)|~exemplifies_property(X2,X4)|~object(X1))).
% 0.20/0.38 cnf(i_0_12, plain, (exemplifies_property(X1,esk1_3(X2,X1,X3))|~is_the(X3,X2)|~exemplifies_property(X1,X3))).
% 0.20/0.38 cnf(i_0_14, plain, (exemplifies_property(X1,esk1_3(X1,X2,X3))|~is_the(X3,X1)|~exemplifies_property(X2,X3))).
% 0.20/0.38 cnf(i_0_24, plain, (exemplifies_property(X1,esk3_3(X1,X2,X2))|~is_the(X2,X1))).
% 0.20/0.38 cnf(i_0_13, plain, (X1=esk1_3(X2,X3,X4)|~is_the(X4,X2)|~exemplifies_property(X3,X4)|~exemplifies_property(X2,X1))).
% 0.20/0.38 cnf(i_0_20, plain, (X1=X2|object(esk4_4(X3,X1,X2,X2))|~exemplifies_property(X3,X2)|~object(X1))).
% 0.20/0.38 cnf(i_0_18, plain, (X1=X2|exemplifies_property(X3,esk4_4(X3,X1,X2,X2))|~exemplifies_property(X3,X2)|~object(X1))).
% 0.20/0.38 cnf(i_0_10, plain, (exemplifies_property(X1,X2)|object(esk2_4(X3,X1,X2,X4))|~exemplifies_property(X3,X4)|~exemplifies_property(X1,X4)|~object(X2))).
% 0.20/0.38 cnf(i_0_11, plain, (is_the(X1,X2)|object(esk2_4(X2,X3,X1,X4))|~exemplifies_property(X3,X4)|~exemplifies_property(X2,X4)|~object(X1))).
% 0.20/0.38 cnf(i_0_8, plain, (exemplifies_property(X1,esk2_4(X1,X2,X3,X4))|exemplifies_property(X2,X3)|~exemplifies_property(X1,X4)|~exemplifies_property(X2,X4)|~object(X3))).
% 0.20/0.38 cnf(i_0_21, plain, (is_the(X1,X2)|object(esk4_4(X2,X1,X3,X3))|~exemplifies_property(X2,X3)|~object(X1))).
% 0.20/0.38 cnf(i_0_19, plain, (is_the(X1,X2)|exemplifies_property(X2,esk4_4(X2,X1,X3,X3))|~exemplifies_property(X2,X3)|~object(X1))).
% 0.20/0.38 cnf(i_0_9, plain, (is_the(X1,X2)|exemplifies_property(X2,esk2_4(X2,X3,X1,X4))|~exemplifies_property(X3,X4)|~exemplifies_property(X2,X4)|~object(X1))).
% 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.38 # Begin printing tableau
% 0.20/0.38 # Found 7 steps
% 0.20/0.38 cnf(i_0_38, negated_conjecture, (~exemplifies_property(existence,god)), inference(start_rule)).
% 0.20/0.38 cnf(i_0_49, plain, (~exemplifies_property(existence,god)), inference(extension_rule, [i_0_8])).
% 0.20/0.38 cnf(i_0_148, plain, (~exemplifies_property(none_greater,esk6_0)), inference(closure_rule, [i_0_32])).
% 0.20/0.38 cnf(i_0_146, plain, (exemplifies_property(none_greater,esk2_4(none_greater,existence,god,esk6_0))), inference(extension_rule, [i_0_2])).
% 0.20/0.38 cnf(i_0_149, plain, (~exemplifies_property(existence,esk6_0)), inference(etableau_closure_rule, [i_0_149, ...])).
% 0.20/0.38 cnf(i_0_150, plain, (~object(god)), inference(etableau_closure_rule, [i_0_150, ...])).
% 0.20/0.38 cnf(i_0_166, plain, (object(esk2_4(none_greater,existence,god,esk6_0))), inference(etableau_closure_rule, [i_0_166, ...])).
% 0.20/0.38 # End printing tableau
% 0.20/0.38 # SZS output end
% 0.20/0.38 # Branches closed with saturation will be marked with an "s"
% 0.20/0.38 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.38 # We now have 6 tableaux to operate on
% 0.20/0.38 # Found closed tableau during pool population.
% 0.20/0.38 # Proof search is over...
% 0.20/0.38 # Freeing feature tree
%------------------------------------------------------------------------------