TSTP Solution File: SYN961+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN961+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 03:33:43 EDT 2024
% Result : Theorem 0.51s 1.00s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 30 ( 15 ~; 6 |; 6 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 17 ( 2 sgn 11 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
( ! [X2] : p(X2)
=> ( p(X1)
& p(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] : p(X2)
=> ( p(X1)
& p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
? [X0,X1] :
( ( ~ p(X1)
| ~ p(X0) )
& ! [X2] : p(X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ? [X0,X1] :
( ( ~ p(X1)
| ~ p(X0) )
& ! [X2] : p(X2) )
=> ( ( ~ p(sK1)
| ~ p(sK0) )
& ! [X2] : p(X2) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
( ( ~ p(sK1)
| ~ p(sK0) )
& ! [X2] : p(X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f3,f4]) ).
fof(f6,plain,
! [X2] : p(X2),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
( ~ p(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f5]) ).
cnf(c_49,negated_conjecture,
( ~ p(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f7]) ).
cnf(c_50,negated_conjecture,
p(X0),
inference(cnf_transformation,[],[f6]) ).
cnf(c_51,plain,
p(sK0),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_52,negated_conjecture,
~ p(sK1),
inference(global_subsumption_just,[status(thm)],[c_49,c_51,c_49]) ).
cnf(c_54,negated_conjecture,
~ p(sK1),
inference(demodulation,[status(thm)],[c_52]) ).
cnf(c_55,negated_conjecture,
p(X0),
inference(demodulation,[status(thm)],[c_50]) ).
cnf(c_56,plain,
$false,
inference(resolution,[status(thm)],[c_54,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SYN961+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.08 % Command : run_iprover %s %d THM
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Thu May 2 21:08:53 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.11/0.35 Running first-order theorem proving
% 0.11/0.35 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
% 0.51/1.00 % SZS status Started for theBenchmark.p
% 0.51/1.00 % SZS status Theorem for theBenchmark.p
% 0.51/1.00
% 0.51/1.00 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.51/1.00
% 0.51/1.00 ------ iProver source info
% 0.51/1.00
% 0.51/1.00 git: date: 2024-05-02 19:28:25 +0000
% 0.51/1.00 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.51/1.00 git: non_committed_changes: false
% 0.51/1.00
% 0.51/1.00 ------ Parsing...
% 0.51/1.00 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.51/1.00
% 0.51/1.00
% 0.51/1.00 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.51/1.00
% 0.51/1.00 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.51/1.00 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.51/1.00 ------ Proving...
% 0.51/1.00 ------ Problem Properties
% 0.51/1.00
% 0.51/1.00
% 0.51/1.00 clauses 2
% 0.51/1.00 conjectures 2
% 0.51/1.00 EPR 2
% 0.51/1.00 Horn 2
% 0.51/1.00 unary 2
% 0.51/1.00 binary 0
% 0.51/1.00 lits 2
% 0.51/1.00 lits eq 0
% 0.51/1.00 fd_pure 0
% 0.51/1.00 fd_pseudo 0
% 0.51/1.00 fd_cond 0
% 0.51/1.00 fd_pseudo_cond 0
% 0.51/1.00 AC symbols 0
% 0.51/1.00
% 0.51/1.00 ------ Schedule EPR Horn non eq is on
% 0.51/1.00
% 0.51/1.00 ------ no equalities: superposition off
% 0.51/1.00
% 0.51/1.00 ------ Option_epr_horn Time Limit: Unbounded
% 0.51/1.00
% 0.51/1.00
% 0.51/1.00 ------
% 0.51/1.00 Current options:
% 0.51/1.00 ------
% 0.51/1.00
% 0.51/1.00
% 0.51/1.00
% 0.51/1.00
% 0.51/1.00 ------ Proving...
% 0.51/1.00
% 0.51/1.00
% 0.51/1.00 % SZS status Theorem for theBenchmark.p
% 0.51/1.00
% 0.51/1.00 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.51/1.00
% 0.51/1.00
%------------------------------------------------------------------------------