TSTP Solution File: SYN409+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN409+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:30:32 EDT 2024
% Result : Theorem 1.97s 1.20s
% Output : CNFRefutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 64 ( 29 ~; 21 |; 9 &)
% ( 2 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 34 ( 5 sgn 20 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] : f(X0)
<=> ! [X1,X2] :
( f(X2)
& f(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish246) ).
fof(f2,negated_conjecture,
~ ( ! [X0] : f(X0)
<=> ! [X1,X2] :
( f(X2)
& f(X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
( ! [X0] : f(X0)
<~> ! [X1,X2] :
( f(X2)
& f(X1) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ( ? [X1,X2] :
( ~ f(X2)
| ~ f(X1) )
| ? [X0] : ~ f(X0) )
& ( ! [X1,X2] :
( f(X2)
& f(X1) )
| ! [X0] : f(X0) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ? [X0,X1] :
( ~ f(X1)
| ~ f(X0) )
| ? [X2] : ~ f(X2) )
& ( ! [X3,X4] :
( f(X4)
& f(X3) )
| ! [X5] : f(X5) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
( ? [X0,X1] :
( ~ f(X1)
| ~ f(X0) )
=> ( ~ f(sK1)
| ~ f(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ? [X2] : ~ f(X2)
=> ~ f(sK2) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ( ~ f(sK1)
| ~ f(sK0)
| ~ f(sK2) )
& ( ! [X3,X4] :
( f(X4)
& f(X3) )
| ! [X5] : f(X5) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f5,f7,f6]) ).
fof(f9,plain,
! [X3,X5] :
( f(X3)
| f(X5) ),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
( ~ f(sK1)
| ~ f(sK0)
| ~ f(sK2) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,negated_conjecture,
( ~ f(sK1)
| ~ f(sK0)
| ~ f(sK2) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_51,negated_conjecture,
( f(X0)
| f(X1) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_52,plain,
f(sK0),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_53,negated_conjecture,
( ~ f(sK1)
| ~ f(sK2) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_52,c_49]) ).
cnf(c_71,negated_conjecture,
( f(X0)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_51]) ).
cnf(c_72,negated_conjecture,
sP0_iProver_def,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_51]) ).
cnf(c_73,negated_conjecture,
( ~ f(sK1)
| ~ f(sK2) ),
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_74,negated_conjecture,
sP0_iProver_def,
inference(demodulation,[status(thm)],[c_72]) ).
cnf(c_76,negated_conjecture,
( ~ sP0_iProver_def
| f(X0) ),
inference(demodulation,[status(thm)],[c_71]) ).
cnf(c_79,negated_conjecture,
f(X0),
inference(global_subsumption_just,[status(thm)],[c_76,c_74,c_76]) ).
cnf(c_81,plain,
~ f(sK2),
inference(resolution,[status(thm)],[c_73,c_79]) ).
cnf(c_82,plain,
$false,
inference(resolution,[status(thm)],[c_81,c_79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN409+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n021.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 : 300
% 0.12/0.33 % DateTime : Thu May 2 21:05:58 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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.97/1.20 % SZS status Started for theBenchmark.p
% 1.97/1.20 % SZS status Theorem for theBenchmark.p
% 1.97/1.20
% 1.97/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.97/1.20
% 1.97/1.20 ------ iProver source info
% 1.97/1.20
% 1.97/1.20 git: date: 2024-05-02 19:28:25 +0000
% 1.97/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.97/1.20 git: non_committed_changes: false
% 1.97/1.20
% 1.97/1.20 ------ Parsing...
% 1.97/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 1.97/1.20
% 1.97/1.20
% 1.97/1.20 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.97/1.20
% 1.97/1.20 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 1.97/1.20 gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.97/1.20 ------ Proving...
% 1.97/1.20 ------ Problem Properties
% 1.97/1.20
% 1.97/1.20
% 1.97/1.20 clauses 3
% 1.97/1.20 conjectures 3
% 1.97/1.20 EPR 3
% 1.97/1.20 Horn 3
% 1.97/1.20 unary 1
% 1.97/1.20 binary 2
% 1.97/1.20 lits 5
% 1.97/1.20 lits eq 0
% 1.97/1.20 fd_pure 0
% 1.97/1.20 fd_pseudo 0
% 1.97/1.20 fd_cond 0
% 1.97/1.20 fd_pseudo_cond 0
% 1.97/1.20 AC symbols 0
% 1.97/1.20
% 1.97/1.20 ------ Schedule EPR Horn non eq is on
% 1.97/1.20
% 1.97/1.20 ------ no equalities: superposition off
% 1.97/1.20
% 1.97/1.20 ------ Option_epr_horn Time Limit: Unbounded
% 1.97/1.20
% 1.97/1.20
% 1.97/1.20 ------
% 1.97/1.20 Current options:
% 1.97/1.20 ------
% 1.97/1.20
% 1.97/1.20
% 1.97/1.20
% 1.97/1.20
% 1.97/1.20 ------ Proving...
% 1.97/1.20
% 1.97/1.20
% 1.97/1.20 % SZS status Theorem for theBenchmark.p
% 1.97/1.20
% 1.97/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.97/1.20
% 1.97/1.20
%------------------------------------------------------------------------------