TSTP Solution File: PHI013+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PHI013+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 : n023.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.18s 0.38s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PHI013+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.12/0.33 % Computer : n023.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:22:56 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___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 24 Number of unprocessed: 24
% 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.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 24 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 1 conjectures.
% 0.12/0.37 # There are 1 start rule candidates:
% 0.12/0.37 # Found 4 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 20 extension rule candidate clauses
% 0.12/0.37 # 4 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.18/0.38 # There were 4 total branch saturation attempts.
% 0.18/0.38 # There were 0 of these attempts blocked.
% 0.18/0.38 # There were 0 deferred branch saturation attempts.
% 0.18/0.38 # There were 0 free duplicated saturations.
% 0.18/0.38 # There were 4 total successful branch saturations.
% 0.18/0.38 # There were 0 successful branch saturations in interreduction.
% 0.18/0.38 # There were 0 successful branch saturations on the branch.
% 0.18/0.38 # There were 4 successful branch saturations after the branch.
% 0.18/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.38 # Begin clausification derivation
% 0.18/0.38
% 0.18/0.38 # End clausification derivation
% 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.38 cnf(i_0_16, plain, (object(esk4_0))).
% 0.18/0.38 cnf(i_0_15, plain, (exemplifies_property(none_greater,esk4_0))).
% 0.18/0.38 cnf(i_0_23, plain, (is_the(god,none_greater))).
% 0.18/0.38 cnf(i_0_24, negated_conjecture, (~exemplifies_property(existence,god))).
% 0.18/0.38 cnf(i_0_14, plain, (exemplifies_property(conceivable,X1)|~exemplifies_property(none_greater,X1)|~object(X1))).
% 0.18/0.38 cnf(i_0_8, plain, (object(X1)|~is_the(X1,X2))).
% 0.18/0.38 cnf(i_0_19, plain, (object(esk5_0)|~exemplifies_property(none_greater,X1)|~object(X1))).
% 0.18/0.38 cnf(i_0_9, plain, (property(X1)|~is_the(X2,X1))).
% 0.18/0.38 cnf(i_0_18, plain, (exemplifies_property(none_greater,esk5_0)|~exemplifies_property(none_greater,X1)|~object(X1))).
% 0.18/0.38 cnf(i_0_22, plain, (exemplifies_property(existence,X1)|object(esk6_1(X1))|~is_the(X1,none_greater))).
% 0.18/0.38 cnf(i_0_12, plain, (exemplifies_property(none_greater,X1)|object(esk3_1(X1))|~exemplifies_property(conceivable,X1)|~object(X1))).
% 0.18/0.38 cnf(i_0_20, plain, (exemplifies_property(conceivable,esk6_1(X1))|exemplifies_property(existence,X1)|~is_the(X1,none_greater))).
% 0.18/0.38 cnf(i_0_10, plain, (exemplifies_property(conceivable,esk3_1(X1))|exemplifies_property(none_greater,X1)|~exemplifies_property(conceivable,X1)|~object(X1))).
% 0.18/0.38 cnf(i_0_17, plain, (X1=esk5_0|~exemplifies_property(none_greater,X2)|~exemplifies_property(none_greater,X1)|~object(X2)|~object(X1))).
% 0.18/0.38 cnf(i_0_11, plain, (exemplifies_relation(greater_than,esk3_1(X1),X1)|exemplifies_property(none_greater,X1)|~exemplifies_property(conceivable,X1)|~object(X1))).
% 0.18/0.38 cnf(i_0_21, plain, (exemplifies_relation(greater_than,esk6_1(X1),X1)|exemplifies_property(existence,X1)|~is_the(X1,none_greater))).
% 0.18/0.38 cnf(i_0_6, plain, (object(esk1_2(X1,X2))|object(esk2_1(X1))|~exemplifies_property(X1,X2)|~object(X2)|~property(X1))).
% 0.18/0.38 cnf(i_0_2, plain, (object(esk2_1(X1))|esk1_2(X1,X2)!=X2|~exemplifies_property(X1,X2)|~object(X2)|~property(X1))).
% 0.18/0.38 cnf(i_0_4, plain, (exemplifies_property(X1,esk1_2(X1,X2))|object(esk2_1(X1))|~exemplifies_property(X1,X2)|~object(X2)|~property(X1))).
% 0.18/0.38 cnf(i_0_3, plain, (is_the(esk2_1(X1),X1)|exemplifies_property(X1,esk1_2(X1,X2))|~exemplifies_property(X1,X2)|~object(X2)|~property(X1))).
% 0.18/0.38 cnf(i_0_7, plain, (exemplifies_property(X1,X2)|~is_the(X2,X1)|~is_the(X3,X1))).
% 0.18/0.38 cnf(i_0_1, plain, (is_the(esk2_1(X1),X1)|esk1_2(X1,X2)!=X2|~exemplifies_property(X1,X2)|~object(X2)|~property(X1))).
% 0.18/0.38 cnf(i_0_5, plain, (is_the(esk2_1(X1),X1)|object(esk1_2(X1,X2))|~exemplifies_property(X1,X2)|~object(X2)|~property(X1))).
% 0.18/0.38 cnf(i_0_13, plain, (~exemplifies_relation(greater_than,X1,X2)|~exemplifies_property(none_greater,X2)|~exemplifies_property(conceivable,X1)|~object(X2)|~object(X1))).
% 0.18/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.38 # Begin printing tableau
% 0.18/0.38 # Found 8 steps
% 0.18/0.38 cnf(i_0_24, negated_conjecture, (~exemplifies_property(existence,god)), inference(start_rule)).
% 0.18/0.38 cnf(i_0_25, plain, (~exemplifies_property(existence,god)), inference(extension_rule, [i_0_7])).
% 0.18/0.38 cnf(i_0_87, plain, (~is_the(esk2_1(existence),existence)), inference(extension_rule, [i_0_3])).
% 0.18/0.38 cnf(i_0_237, plain, (~object(esk4_0)), inference(closure_rule, [i_0_16])).
% 0.18/0.38 cnf(i_0_86, plain, (~is_the(god,existence)), inference(etableau_closure_rule, [i_0_86, ...])).
% 0.18/0.38 cnf(i_0_235, plain, (exemplifies_property(existence,esk1_2(existence,esk4_0))), inference(etableau_closure_rule, [i_0_235, ...])).
% 0.18/0.38 cnf(i_0_236, plain, (~exemplifies_property(existence,esk4_0)), inference(etableau_closure_rule, [i_0_236, ...])).
% 0.18/0.38 cnf(i_0_238, plain, (~property(existence)), inference(etableau_closure_rule, [i_0_238, ...])).
% 0.18/0.38 # End printing tableau
% 0.18/0.38 # SZS output end
% 0.18/0.38 # Branches closed with saturation will be marked with an "s"
% 0.18/0.38 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.38 # We now have 4 tableaux to operate on
% 0.18/0.38 # Found closed tableau during pool population.
% 0.18/0.38 # Proof search is over...
% 0.18/0.38 # Freeing feature tree
%------------------------------------------------------------------------------