TSTP Solution File: SYN396+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN396+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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:27 EDT 2024
% Result : Theorem 1.52s 1.19s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 45 ( 25 ~; 12 |; 3 &)
% ( 2 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 25 ( 5 sgn 10 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ~ ! [X0] : f(X0)
<=> ? [X1] : ~ f(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish203) ).
fof(f2,negated_conjecture,
~ ( ~ ! [X0] : f(X0)
<=> ? [X1] : ~ f(X1) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
( ? [X0] : ~ f(X0)
<~> ? [X1] : ~ f(X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ( ! [X1] : f(X1)
| ! [X0] : f(X0) )
& ( ? [X1] : ~ f(X1)
| ? [X0] : ~ f(X0) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ! [X0] : f(X0)
| ! [X1] : f(X1) )
& ( ? [X2] : ~ f(X2)
| ? [X3] : ~ f(X3) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
( ? [X2] : ~ f(X2)
=> ~ f(sK0) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ? [X3] : ~ f(X3)
=> ~ f(sK1) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ( ! [X0] : f(X0)
| ! [X1] : f(X1) )
& ( ~ f(sK0)
| ~ f(sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f5,f7,f6]) ).
fof(f9,plain,
( ~ f(sK0)
| ~ f(sK1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( f(X0)
| f(X1) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,negated_conjecture,
( f(X0)
| f(X1) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_50,negated_conjecture,
( ~ f(sK0)
| ~ f(sK1) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_51,plain,
f(sK0),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_52,negated_conjecture,
~ f(sK1),
inference(global_subsumption_just,[status(thm)],[c_50,c_51,c_50]) ).
cnf(c_60,negated_conjecture,
( f(X0)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_49]) ).
cnf(c_61,negated_conjecture,
sP0_iProver_def,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_49]) ).
cnf(c_62,negated_conjecture,
~ f(sK1),
inference(demodulation,[status(thm)],[c_52]) ).
cnf(c_63,negated_conjecture,
sP0_iProver_def,
inference(demodulation,[status(thm)],[c_61]) ).
cnf(c_65,negated_conjecture,
( ~ sP0_iProver_def
| f(X0) ),
inference(demodulation,[status(thm)],[c_60]) ).
cnf(c_68,negated_conjecture,
f(X0),
inference(global_subsumption_just,[status(thm)],[c_65,c_63,c_65]) ).
cnf(c_70,plain,
$false,
inference(resolution,[status(thm)],[c_68,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYN396+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu May 2 20:42:25 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.52/1.19 % SZS status Started for theBenchmark.p
% 1.52/1.19 % SZS status Theorem for theBenchmark.p
% 1.52/1.19
% 1.52/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.52/1.19
% 1.52/1.19 ------ iProver source info
% 1.52/1.19
% 1.52/1.19 git: date: 2024-05-02 19:28:25 +0000
% 1.52/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.52/1.19 git: non_committed_changes: false
% 1.52/1.19
% 1.52/1.19 ------ Parsing...
% 1.52/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.52/1.19
% 1.52/1.19 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 1.52/1.19 gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.52/1.19 ------ Proving...
% 1.52/1.19 ------ Problem Properties
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 clauses 3
% 1.52/1.19 conjectures 3
% 1.52/1.19 EPR 3
% 1.52/1.19 Horn 3
% 1.52/1.19 unary 2
% 1.52/1.19 binary 1
% 1.52/1.19 lits 4
% 1.52/1.19 lits eq 0
% 1.52/1.19 fd_pure 0
% 1.52/1.19 fd_pseudo 0
% 1.52/1.19 fd_cond 0
% 1.52/1.19 fd_pseudo_cond 0
% 1.52/1.19 AC symbols 0
% 1.52/1.19
% 1.52/1.19 ------ Schedule EPR Horn non eq is on
% 1.52/1.19
% 1.52/1.19 ------ no equalities: superposition off
% 1.52/1.19
% 1.52/1.19 ------ Option_epr_horn Time Limit: Unbounded
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 ------
% 1.52/1.19 Current options:
% 1.52/1.19 ------
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 ------ Proving...
% 1.52/1.19
% 1.52/1.19
% 1.52/1.19 % SZS status Theorem for theBenchmark.p
% 1.52/1.19
% 1.52/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.52/1.19
% 1.52/1.19
%------------------------------------------------------------------------------