TSTP Solution File: PHI014+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : PHI014+1 : TPTP v8.1.2. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n010.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 : 300s
% DateTime : Mon Mar 25 14:28:36 EDT 2024
% Result : Theorem 0.19s 0.37s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : PHI014+1 : TPTP v8.1.2. Released v7.2.0.
% 0.03/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Mar 21 00:46:18 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.37 % SZS status Theorem for theBenchmark
% 0.19/0.37 % SZS output start Proof for theBenchmark
% 0.19/0.37
% 0.19/0.37 % Formula: description_theorem_2 ( axiom ) converted to clauses:
% 0.19/0.37 cnf(description_theorem_2-1, axiom, ( ~property(_u2) | ~object(_u0) | ~is_the(_u0, _u2) | ~object(_u1) | ~is_the(_u1, _u2) | exemplifies_property(_u2, _u1) )).
% 0.19/0.37
% 0.19/0.37 % Formula: description_is_property_and_described_is_object ( axiom ) converted to clauses:
% 0.19/0.37 cnf(description_is_property_and_described_is_object-1, axiom, ( ~is_the(_u4, _u3) | property(_u3) )).
% 0.19/0.37 cnf(description_is_property_and_described_is_object-2, axiom, ( ~is_the(_u4, _u3) | object(_u4) )).
% 0.19/0.37
% 0.19/0.37 % Formula: definition_none_greater ( axiom ) converted to clauses:
% 0.19/0.37 cnf(definition_none_greater-1, axiom, ( ~object(_u7) | ~exemplifies_property(none_greater, _u7) | exemplifies_property(conceivable, _u7) )).
% 0.19/0.37 cnf(definition_none_greater-2, axiom, ( ~object(_u7) | ~exemplifies_property(none_greater, _u7) | ~object(_u5) | ~exemplifies_relation(greater_than, _u5, _u7) | ~exemplifies_property(conceivable, _u5) )).
% 0.19/0.37 cnf(definition_none_greater-3, axiom, ( ~object(_u7) | exemplifies_property(none_greater, _u7) | ~exemplifies_property(conceivable, _u7) | object(skolem1(_u7)) )).
% 0.19/0.37 cnf(definition_none_greater-4, axiom, ( ~object(_u7) | exemplifies_property(none_greater, _u7) | ~exemplifies_property(conceivable, _u7) | exemplifies_relation(greater_than, skolem1(_u7), _u7) )).
% 0.19/0.37 cnf(definition_none_greater-5, axiom, ( ~object(_u7) | exemplifies_property(none_greater, _u7) | ~exemplifies_property(conceivable, _u7) | exemplifies_property(conceivable, skolem1(_u7)) )).
% 0.19/0.37
% 0.19/0.37 % Formula: premise_2 ( axiom ) converted to clauses:
% 0.19/0.37 cnf(premise_2-1, axiom, ( ~object(_u9) | ~is_the(_u9, none_greater) | exemplifies_property(existence, _u9) | object(skolem2(_u9)) )).
% 0.19/0.37 cnf(premise_2-2, axiom, ( ~object(_u9) | ~is_the(_u9, none_greater) | exemplifies_property(existence, _u9) | exemplifies_relation(greater_than, skolem2(_u9), _u9) )).
% 0.19/0.37 cnf(premise_2-3, axiom, ( ~object(_u9) | ~is_the(_u9, none_greater) | exemplifies_property(existence, _u9) | exemplifies_property(conceivable, skolem2(_u9)) )).
% 0.19/0.37
% 0.19/0.37 % Formula: definition_god ( axiom ) converted to clauses:
% 0.19/0.37 cnf(definition_god-1, axiom, ( is_the(god, none_greater) )).
% 0.19/0.37
% 0.19/0.37 % Formula: god_exists ( conjecture ) (definitionally) converted to clauses:
% 0.19/0.37 cnf(god_exists-1, negated_conjecture, ( ~exemplifies_property(existence, god) )).
% 0.19/0.37
% 0.19/0.37 % Problem matrix:
% 0.19/0.37 cnf(matrix-0, plain, ( ~property(_u2) | ~object(_u0) | ~is_the(_u0, _u2) | ~object(_u1) | ~is_the(_u1, _u2) | exemplifies_property(_u2, _u1) )).
% 0.19/0.37 cnf(matrix-1, plain, ( ~is_the(_u4, _u3) | property(_u3) )).
% 0.19/0.37 cnf(matrix-2, plain, ( ~is_the(_u4, _u3) | object(_u4) )).
% 0.19/0.37 cnf(matrix-3, plain, ( ~object(_u7) | ~exemplifies_property(none_greater, _u7) | exemplifies_property(conceivable, _u7) )).
% 0.19/0.37 cnf(matrix-4, plain, ( ~object(_u7) | ~exemplifies_property(none_greater, _u7) | ~object(_u5) | ~exemplifies_relation(greater_than, _u5, _u7) | ~exemplifies_property(conceivable, _u5) )).
% 0.19/0.37 cnf(matrix-5, plain, ( ~object(_u7) | exemplifies_property(none_greater, _u7) | ~exemplifies_property(conceivable, _u7) | object(skolem1(_u7)) )).
% 0.19/0.37 cnf(matrix-6, plain, ( ~object(_u7) | exemplifies_property(none_greater, _u7) | ~exemplifies_property(conceivable, _u7) | exemplifies_relation(greater_than, skolem1(_u7), _u7) )).
% 0.19/0.37 cnf(matrix-7, plain, ( ~object(_u7) | exemplifies_property(none_greater, _u7) | ~exemplifies_property(conceivable, _u7) | exemplifies_property(conceivable, skolem1(_u7)) )).
% 0.19/0.37 cnf(matrix-8, plain, ( ~object(_u9) | ~is_the(_u9, none_greater) | exemplifies_property(existence, _u9) | object(skolem2(_u9)) )).
% 0.19/0.37 cnf(matrix-9, plain, ( ~object(_u9) | ~is_the(_u9, none_greater) | exemplifies_property(existence, _u9) | exemplifies_relation(greater_than, skolem2(_u9), _u9) )).
% 0.19/0.37 cnf(matrix-10, plain, ( ~object(_u9) | ~is_the(_u9, none_greater) | exemplifies_property(existence, _u9) | exemplifies_property(conceivable, skolem2(_u9)) )).
% 0.19/0.37 cnf(matrix-11, plain, ( is_the(god, none_greater) )).
% 0.19/0.37 cnf(matrix-12, plain, ( ~exemplifies_property(existence, god) )).
% 0.19/0.37
% 0.19/0.37 % Proof stack:
% 0.19/0.37 cnf(proof-stack, plain,
% 0.19/0.37 proof_stack(
% 0.19/0.37 start(12),
% 0.19/0.37 left_branch(0, 9, 2, 2),
% 0.19/0.37 left_branch(0, 2, 1, 3),
% 0.19/0.37 left_branch(0, 11, 0, 4),
% 0.19/0.37 right_branch(4),
% 0.19/0.37 right_branch(3),
% 0.19/0.37 left_branch(0, 4, 3, 4),
% 0.19/0.37 lemmata(0, 0),
% 0.19/0.37 left_branch(0, 10, 3, 6),
% 0.19/0.37 lemmata(0, 0),
% 0.19/0.37 reduction(0, 0),
% 0.19/0.37 left_branch(0, 11, 0, 9),
% 0.19/0.37 right_branch(9),
% 0.19/0.37 right_branch(6),
% 0.19/0.37 left_branch(0, 8, 3, 7),
% 0.19/0.37 lemmata(0, 0),
% 0.19/0.37 reduction(0, 0),
% 0.19/0.37 left_branch(0, 11, 0, 10),
% 0.19/0.37 right_branch(10),
% 0.19/0.37 right_branch(7),
% 0.19/0.37 left_branch(0, 0, 5, 8),
% 0.19/0.37 left_branch(0, 1, 1, 9),
% 0.19/0.37 left_branch(0, 11, 0, 10),
% 0.19/0.37 right_branch(10),
% 0.19/0.37 right_branch(9),
% 0.19/0.37 left_branch(0, 11, 0, 10),
% 0.19/0.37 right_branch(10),
% 0.19/0.37 lemmata(0, 0),
% 0.19/0.37 left_branch(0, 11, 0, 12),
% 0.19/0.37 right_branch(12),
% 0.19/0.37 lemmata(0, 0),
% 0.19/0.37 right_branch(8),
% 0.19/0.37 right_branch(4),
% 0.19/0.37 left_branch(0, 11, 0, 5),
% 0.19/0.37 right_branch(5),
% 0.19/0.37 right_branch(2)
% 0.19/0.37 )).
% 0.19/0.37 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------