TSTP Solution File: PUZ128+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : PUZ128+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:54:55 EDT 2024
% Result : Theorem 1.61s 1.17s
% Output : CNFRefutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 21 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 48 ( 24 ~; 18 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 4 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
parent_of(iokaste,oedipus),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_oedipus) ).
fof(f2,axiom,
parent_of(iokaste,polyneikes),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_polyneikes) ).
fof(f3,axiom,
parent_of(oedipus,polyneikes),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_polyneikes) ).
fof(f4,axiom,
parent_of(polyneikes,thersandros),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',polyneikes_thersandros) ).
fof(f5,axiom,
patricide(oedipus),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_patricidal) ).
fof(f6,axiom,
~ patricide(thersandros),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thersandros_not_patricidal) ).
fof(f7,conjecture,
? [X0,X1] :
( ~ patricide(X1)
& parent_of(X0,X1)
& patricide(X0)
& parent_of(iokaste,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_parent_particide_parent_not_patricide) ).
fof(f8,negated_conjecture,
~ ? [X0,X1] :
( ~ patricide(X1)
& parent_of(X0,X1)
& patricide(X0)
& parent_of(iokaste,X0) ),
inference(negated_conjecture,[],[f7]) ).
fof(f9,plain,
! [X0,X1] :
( patricide(X1)
| ~ parent_of(X0,X1)
| ~ patricide(X0)
| ~ parent_of(iokaste,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f10,plain,
parent_of(iokaste,oedipus),
inference(cnf_transformation,[],[f1]) ).
fof(f11,plain,
parent_of(iokaste,polyneikes),
inference(cnf_transformation,[],[f2]) ).
fof(f12,plain,
parent_of(oedipus,polyneikes),
inference(cnf_transformation,[],[f3]) ).
fof(f13,plain,
parent_of(polyneikes,thersandros),
inference(cnf_transformation,[],[f4]) ).
fof(f14,plain,
patricide(oedipus),
inference(cnf_transformation,[],[f5]) ).
fof(f15,plain,
~ patricide(thersandros),
inference(cnf_transformation,[],[f6]) ).
fof(f16,plain,
! [X0,X1] :
( patricide(X1)
| ~ parent_of(X0,X1)
| ~ patricide(X0)
| ~ parent_of(iokaste,X0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,plain,
parent_of(iokaste,oedipus),
inference(cnf_transformation,[],[f10]) ).
cnf(c_50,plain,
parent_of(iokaste,polyneikes),
inference(cnf_transformation,[],[f11]) ).
cnf(c_51,plain,
parent_of(oedipus,polyneikes),
inference(cnf_transformation,[],[f12]) ).
cnf(c_52,plain,
parent_of(polyneikes,thersandros),
inference(cnf_transformation,[],[f13]) ).
cnf(c_53,plain,
patricide(oedipus),
inference(cnf_transformation,[],[f14]) ).
cnf(c_54,plain,
~ patricide(thersandros),
inference(cnf_transformation,[],[f15]) ).
cnf(c_55,negated_conjecture,
( ~ parent_of(X0,X1)
| ~ parent_of(iokaste,X0)
| ~ patricide(X0)
| patricide(X1) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_56,negated_conjecture,
( ~ parent_of(X0,X1)
| ~ parent_of(iokaste,X0)
| ~ patricide(X0)
| patricide(X1) ),
inference(demodulation,[status(thm)],[c_55]) ).
cnf(c_57,plain,
( ~ parent_of(oedipus,X0)
| ~ parent_of(iokaste,oedipus)
| patricide(X0) ),
inference(resolution,[status(thm)],[c_53,c_56]) ).
cnf(c_59,plain,
( ~ parent_of(oedipus,X0)
| patricide(X0) ),
inference(global_subsumption_just,[status(thm)],[c_57,c_49,c_57]) ).
cnf(c_62,plain,
patricide(polyneikes),
inference(resolution,[status(thm)],[c_51,c_59]) ).
cnf(c_63,plain,
( ~ parent_of(polyneikes,X0)
| ~ parent_of(iokaste,polyneikes)
| patricide(X0) ),
inference(resolution,[status(thm)],[c_62,c_56]) ).
cnf(c_65,plain,
( ~ parent_of(polyneikes,X0)
| patricide(X0) ),
inference(global_subsumption_just,[status(thm)],[c_63,c_50,c_63]) ).
cnf(c_68,plain,
patricide(thersandros),
inference(resolution,[status(thm)],[c_52,c_65]) ).
cnf(c_69,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_68,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : PUZ128+1 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n022.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu May 2 21:03:12 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.61/1.17 % SZS status Started for theBenchmark.p
% 1.61/1.17 % SZS status Theorem for theBenchmark.p
% 1.61/1.17
% 1.61/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.61/1.17
% 1.61/1.17 ------ iProver source info
% 1.61/1.17
% 1.61/1.17 git: date: 2024-05-02 19:28:25 +0000
% 1.61/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.61/1.17 git: non_committed_changes: false
% 1.61/1.17
% 1.61/1.17 ------ Parsing...
% 1.61/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 1.61/1.17
% 1.61/1.17
% 1.61/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.61/1.17
% 1.61/1.17 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.61/1.17 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.61/1.17 ------ Proving...
% 1.61/1.17 ------ Problem Properties
% 1.61/1.17
% 1.61/1.17
% 1.61/1.17 clauses 7
% 1.61/1.17 conjectures 1
% 1.61/1.17 EPR 7
% 1.61/1.17 Horn 7
% 1.61/1.17 unary 6
% 1.61/1.17 binary 0
% 1.61/1.17 lits 10
% 1.61/1.17 lits eq 0
% 1.61/1.17 fd_pure 0
% 1.61/1.17 fd_pseudo 0
% 1.61/1.17 fd_cond 0
% 1.61/1.17 fd_pseudo_cond 0
% 1.61/1.17 AC symbols 0
% 1.61/1.17
% 1.61/1.17 ------ Schedule EPR Horn non eq is on
% 1.61/1.17
% 1.61/1.17 ------ no equalities: superposition off
% 1.61/1.17
% 1.61/1.17 ------ Option_epr_horn Time Limit: Unbounded
% 1.61/1.17
% 1.61/1.17
% 1.61/1.17 ------
% 1.61/1.17 Current options:
% 1.61/1.17 ------
% 1.61/1.17
% 1.61/1.17
% 1.61/1.17
% 1.61/1.17
% 1.61/1.17 ------ Proving...
% 1.61/1.17
% 1.61/1.17
% 1.61/1.17 % SZS status Theorem for theBenchmark.p
% 1.61/1.17
% 1.61/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.61/1.17
% 1.61/1.17
%------------------------------------------------------------------------------