TSTP Solution File: PHI012+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : PHI012+1 : TPTP v8.1.2. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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 : Fri May 3 02:53:37 EDT 2024
% Result : Theorem 1.90s 1.14s
% Output : CNFRefutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of formulae : 52 ( 8 unt; 0 def)
% Number of atoms : 242 ( 28 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 313 ( 123 ~; 118 |; 56 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 77 ( 0 sgn 34 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( object(X0)
=> ( exemplifies_property(none_greater,X0)
<=> ( ~ ? [X1] :
( exemplifies_property(conceivable,X1)
& exemplifies_relation(greater_than,X1,X0)
& object(X1) )
& exemplifies_property(conceivable,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_none_greater) ).
fof(f2,axiom,
! [X0,X1] :
( ( object(X1)
& object(X0) )
=> ( X0 = X1
| exemplifies_relation(greater_than,X1,X0)
| exemplifies_relation(greater_than,X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',connectedness_of_greater_than) ).
fof(f3,conjecture,
( ? [X0] :
( exemplifies_property(none_greater,X0)
& object(X0) )
=> ? [X0] :
( ! [X1] :
( object(X1)
=> ( exemplifies_property(none_greater,X1)
=> X0 = X1 ) )
& exemplifies_property(none_greater,X0)
& object(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_2) ).
fof(f4,negated_conjecture,
~ ( ? [X0] :
( exemplifies_property(none_greater,X0)
& object(X0) )
=> ? [X0] :
( ! [X1] :
( object(X1)
=> ( exemplifies_property(none_greater,X1)
=> X0 = X1 ) )
& exemplifies_property(none_greater,X0)
& object(X0) ) ),
inference(negated_conjecture,[],[f3]) ).
fof(f5,plain,
~ ( ? [X0] :
( exemplifies_property(none_greater,X0)
& object(X0) )
=> ? [X1] :
( ! [X2] :
( object(X2)
=> ( exemplifies_property(none_greater,X2)
=> X1 = X2 ) )
& exemplifies_property(none_greater,X1)
& object(X1) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
! [X0] :
( ( exemplifies_property(none_greater,X0)
<=> ( ! [X1] :
( ~ exemplifies_property(conceivable,X1)
| ~ exemplifies_relation(greater_than,X1,X0)
| ~ object(X1) )
& exemplifies_property(conceivable,X0) ) )
| ~ object(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f7,plain,
! [X0,X1] :
( X0 = X1
| exemplifies_relation(greater_than,X1,X0)
| exemplifies_relation(greater_than,X0,X1)
| ~ object(X1)
| ~ object(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f8,plain,
! [X0,X1] :
( X0 = X1
| exemplifies_relation(greater_than,X1,X0)
| exemplifies_relation(greater_than,X0,X1)
| ~ object(X1)
| ~ object(X0) ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
( ! [X1] :
( ? [X2] :
( X1 != X2
& exemplifies_property(none_greater,X2)
& object(X2) )
| ~ exemplifies_property(none_greater,X1)
| ~ object(X1) )
& ? [X0] :
( exemplifies_property(none_greater,X0)
& object(X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f10,plain,
( ! [X1] :
( ? [X2] :
( X1 != X2
& exemplifies_property(none_greater,X2)
& object(X2) )
| ~ exemplifies_property(none_greater,X1)
| ~ object(X1) )
& ? [X0] :
( exemplifies_property(none_greater,X0)
& object(X0) ) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0] :
( ( ( exemplifies_property(none_greater,X0)
| ? [X1] :
( exemplifies_property(conceivable,X1)
& exemplifies_relation(greater_than,X1,X0)
& object(X1) )
| ~ exemplifies_property(conceivable,X0) )
& ( ( ! [X1] :
( ~ exemplifies_property(conceivable,X1)
| ~ exemplifies_relation(greater_than,X1,X0)
| ~ object(X1) )
& exemplifies_property(conceivable,X0) )
| ~ exemplifies_property(none_greater,X0) ) )
| ~ object(X0) ),
inference(nnf_transformation,[],[f6]) ).
fof(f12,plain,
! [X0] :
( ( ( exemplifies_property(none_greater,X0)
| ? [X1] :
( exemplifies_property(conceivable,X1)
& exemplifies_relation(greater_than,X1,X0)
& object(X1) )
| ~ exemplifies_property(conceivable,X0) )
& ( ( ! [X1] :
( ~ exemplifies_property(conceivable,X1)
| ~ exemplifies_relation(greater_than,X1,X0)
| ~ object(X1) )
& exemplifies_property(conceivable,X0) )
| ~ exemplifies_property(none_greater,X0) ) )
| ~ object(X0) ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
! [X0] :
( ( ( exemplifies_property(none_greater,X0)
| ? [X1] :
( exemplifies_property(conceivable,X1)
& exemplifies_relation(greater_than,X1,X0)
& object(X1) )
| ~ exemplifies_property(conceivable,X0) )
& ( ( ! [X2] :
( ~ exemplifies_property(conceivable,X2)
| ~ exemplifies_relation(greater_than,X2,X0)
| ~ object(X2) )
& exemplifies_property(conceivable,X0) )
| ~ exemplifies_property(none_greater,X0) ) )
| ~ object(X0) ),
inference(rectify,[],[f12]) ).
fof(f14,plain,
! [X0] :
( ? [X1] :
( exemplifies_property(conceivable,X1)
& exemplifies_relation(greater_than,X1,X0)
& object(X1) )
=> ( exemplifies_property(conceivable,sK0(X0))
& exemplifies_relation(greater_than,sK0(X0),X0)
& object(sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0] :
( ( ( exemplifies_property(none_greater,X0)
| ( exemplifies_property(conceivable,sK0(X0))
& exemplifies_relation(greater_than,sK0(X0),X0)
& object(sK0(X0)) )
| ~ exemplifies_property(conceivable,X0) )
& ( ( ! [X2] :
( ~ exemplifies_property(conceivable,X2)
| ~ exemplifies_relation(greater_than,X2,X0)
| ~ object(X2) )
& exemplifies_property(conceivable,X0) )
| ~ exemplifies_property(none_greater,X0) ) )
| ~ object(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f13,f14]) ).
fof(f16,plain,
( ! [X0] :
( ? [X1] :
( X0 != X1
& exemplifies_property(none_greater,X1)
& object(X1) )
| ~ exemplifies_property(none_greater,X0)
| ~ object(X0) )
& ? [X2] :
( exemplifies_property(none_greater,X2)
& object(X2) ) ),
inference(rectify,[],[f10]) ).
fof(f17,plain,
! [X0] :
( ? [X1] :
( X0 != X1
& exemplifies_property(none_greater,X1)
& object(X1) )
=> ( sK1(X0) != X0
& exemplifies_property(none_greater,sK1(X0))
& object(sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( ? [X2] :
( exemplifies_property(none_greater,X2)
& object(X2) )
=> ( exemplifies_property(none_greater,sK2)
& object(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
( ! [X0] :
( ( sK1(X0) != X0
& exemplifies_property(none_greater,sK1(X0))
& object(sK1(X0)) )
| ~ exemplifies_property(none_greater,X0)
| ~ object(X0) )
& exemplifies_property(none_greater,sK2)
& object(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f16,f18,f17]) ).
fof(f20,plain,
! [X0] :
( exemplifies_property(conceivable,X0)
| ~ exemplifies_property(none_greater,X0)
| ~ object(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f21,plain,
! [X2,X0] :
( ~ exemplifies_property(conceivable,X2)
| ~ exemplifies_relation(greater_than,X2,X0)
| ~ object(X2)
| ~ exemplifies_property(none_greater,X0)
| ~ object(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
! [X0,X1] :
( X0 = X1
| exemplifies_relation(greater_than,X1,X0)
| exemplifies_relation(greater_than,X0,X1)
| ~ object(X1)
| ~ object(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f26,plain,
object(sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f27,plain,
exemplifies_property(none_greater,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f28,plain,
! [X0] :
( object(sK1(X0))
| ~ exemplifies_property(none_greater,X0)
| ~ object(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
! [X0] :
( exemplifies_property(none_greater,sK1(X0))
| ~ exemplifies_property(none_greater,X0)
| ~ object(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f30,plain,
! [X0] :
( sK1(X0) != X0
| ~ exemplifies_property(none_greater,X0)
| ~ object(X0) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_52,plain,
( ~ exemplifies_relation(greater_than,X0,X1)
| ~ exemplifies_property(none_greater,X1)
| ~ exemplifies_property(conceivable,X0)
| ~ object(X0)
| ~ object(X1) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_53,plain,
( ~ exemplifies_property(none_greater,X0)
| ~ object(X0)
| exemplifies_property(conceivable,X0) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_54,plain,
( ~ object(X0)
| ~ object(X1)
| X0 = X1
| exemplifies_relation(greater_than,X0,X1)
| exemplifies_relation(greater_than,X1,X0) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_55,negated_conjecture,
( sK1(X0) != X0
| ~ exemplifies_property(none_greater,X0)
| ~ object(X0) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_56,negated_conjecture,
( ~ exemplifies_property(none_greater,X0)
| ~ object(X0)
| exemplifies_property(none_greater,sK1(X0)) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_57,negated_conjecture,
( ~ exemplifies_property(none_greater,X0)
| ~ object(X0)
| object(sK1(X0)) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_58,negated_conjecture,
exemplifies_property(none_greater,sK2),
inference(cnf_transformation,[],[f27]) ).
cnf(c_59,negated_conjecture,
object(sK2),
inference(cnf_transformation,[],[f26]) ).
cnf(c_212,negated_conjecture,
object(sK2),
inference(demodulation,[status(thm)],[c_59]) ).
cnf(c_213,negated_conjecture,
exemplifies_property(none_greater,sK2),
inference(demodulation,[status(thm)],[c_58]) ).
cnf(c_215,negated_conjecture,
( ~ exemplifies_property(none_greater,X0)
| ~ object(X0)
| exemplifies_property(none_greater,sK1(X0)) ),
inference(demodulation,[status(thm)],[c_56]) ).
cnf(c_216,negated_conjecture,
( sK1(X0) != X0
| ~ exemplifies_property(none_greater,X0)
| ~ object(X0) ),
inference(demodulation,[status(thm)],[c_55]) ).
cnf(c_549,plain,
( ~ exemplifies_property(none_greater,X0)
| ~ exemplifies_property(conceivable,X1)
| ~ object(X0)
| ~ object(X1)
| X0 = X1
| exemplifies_relation(greater_than,X0,X1) ),
inference(superposition,[status(thm)],[c_54,c_52]) ).
cnf(c_584,plain,
( ~ exemplifies_property(none_greater,X0)
| ~ exemplifies_property(none_greater,X1)
| ~ exemplifies_property(conceivable,X0)
| ~ exemplifies_property(conceivable,X1)
| ~ object(X0)
| ~ object(X1)
| X0 = X1 ),
inference(superposition,[status(thm)],[c_549,c_52]) ).
cnf(c_592,plain,
( ~ exemplifies_property(none_greater,X1)
| ~ exemplifies_property(none_greater,X0)
| ~ exemplifies_property(conceivable,X1)
| ~ object(X0)
| ~ object(X1)
| X0 = X1 ),
inference(global_subsumption_just,[status(thm)],[c_584,c_53,c_584]) ).
cnf(c_593,plain,
( ~ exemplifies_property(none_greater,X0)
| ~ exemplifies_property(none_greater,X1)
| ~ exemplifies_property(conceivable,X1)
| ~ object(X0)
| ~ object(X1)
| X0 = X1 ),
inference(renaming,[status(thm)],[c_592]) ).
cnf(c_600,plain,
( ~ exemplifies_property(none_greater,X0)
| ~ exemplifies_property(none_greater,X1)
| ~ object(X0)
| ~ object(X1)
| X0 = X1 ),
inference(forward_subsumption_resolution,[status(thm)],[c_593,c_53]) ).
cnf(c_607,plain,
( ~ exemplifies_property(none_greater,X0)
| ~ object(X0)
| ~ object(sK2)
| X0 = sK2 ),
inference(superposition,[status(thm)],[c_213,c_600]) ).
cnf(c_608,plain,
( ~ exemplifies_property(none_greater,X0)
| ~ object(X0)
| X0 = sK2 ),
inference(forward_subsumption_resolution,[status(thm)],[c_607,c_212]) ).
cnf(c_626,plain,
( ~ exemplifies_property(none_greater,X0)
| ~ object(sK1(X0))
| ~ object(X0)
| sK1(X0) = sK2 ),
inference(superposition,[status(thm)],[c_215,c_608]) ).
cnf(c_633,plain,
( ~ exemplifies_property(none_greater,X0)
| ~ object(X0)
| sK1(X0) = sK2 ),
inference(global_subsumption_just,[status(thm)],[c_626,c_57,c_626]) ).
cnf(c_643,plain,
( ~ object(sK2)
| sK1(sK2) = sK2 ),
inference(superposition,[status(thm)],[c_213,c_633]) ).
cnf(c_644,plain,
sK1(sK2) = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_643,c_212]) ).
cnf(c_654,plain,
( ~ exemplifies_property(none_greater,sK2)
| ~ object(sK2) ),
inference(superposition,[status(thm)],[c_644,c_216]) ).
cnf(c_656,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_654,c_212,c_213]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : PHI012+1 : TPTP v8.1.2. Released v7.2.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n004.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 21:35:33 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.90/1.14 % SZS status Started for theBenchmark.p
% 1.90/1.14 % SZS status Theorem for theBenchmark.p
% 1.90/1.14
% 1.90/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.90/1.14
% 1.90/1.14 ------ iProver source info
% 1.90/1.14
% 1.90/1.14 git: date: 2024-05-02 19:28:25 +0000
% 1.90/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.90/1.14 git: non_committed_changes: false
% 1.90/1.14
% 1.90/1.14 ------ Parsing...
% 1.90/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.90/1.14
% 1.90/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.90/1.14
% 1.90/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.90/1.14
% 1.90/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.90/1.14 ------ Proving...
% 1.90/1.14 ------ Problem Properties
% 1.90/1.14
% 1.90/1.14
% 1.90/1.14 clauses 11
% 1.90/1.14 conjectures 5
% 1.90/1.14 EPR 5
% 1.90/1.14 Horn 7
% 1.90/1.14 unary 2
% 1.90/1.14 binary 0
% 1.90/1.14 lits 36
% 1.90/1.14 lits eq 2
% 1.90/1.14 fd_pure 0
% 1.90/1.14 fd_pseudo 0
% 1.90/1.14 fd_cond 0
% 1.90/1.14 fd_pseudo_cond 1
% 1.90/1.14 AC symbols 0
% 1.90/1.14
% 1.90/1.14 ------ Schedule dynamic 5 is on
% 1.90/1.14
% 1.90/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.90/1.14
% 1.90/1.14
% 1.90/1.14 ------
% 1.90/1.14 Current options:
% 1.90/1.14 ------
% 1.90/1.14
% 1.90/1.14
% 1.90/1.14
% 1.90/1.14
% 1.90/1.14 ------ Proving...
% 1.90/1.14
% 1.90/1.14
% 1.90/1.14 % SZS status Theorem for theBenchmark.p
% 1.90/1.14
% 1.90/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.90/1.14
% 1.90/1.14
%------------------------------------------------------------------------------