TSTP Solution File: SYN948+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN948+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:41 EDT 2024
% Result : Theorem 0.78s 1.21s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 19 ( 6 ~; 0 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 20 ( 0 sgn 11 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
? [X1] :
( a(X1,X1)
& a(X0,X1) )
=> ? [X2] : a(X2,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
? [X1] :
( a(X1,X1)
& a(X0,X1) )
=> ? [X2] : a(X2,X2) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
( ! [X2] : ~ a(X2,X2)
& ! [X0] :
? [X1] :
( a(X1,X1)
& a(X0,X1) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ! [X0] : ~ a(X0,X0)
& ! [X1] :
? [X2] :
( a(X2,X2)
& a(X1,X2) ) ),
inference(rectify,[],[f3]) ).
fof(f5,plain,
! [X1] :
( ? [X2] :
( a(X2,X2)
& a(X1,X2) )
=> ( a(sK0(X1),sK0(X1))
& a(X1,sK0(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ! [X0] : ~ a(X0,X0)
& ! [X1] :
( a(sK0(X1),sK0(X1))
& a(X1,sK0(X1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f4,f5]) ).
fof(f8,plain,
! [X1] : a(sK0(X1),sK0(X1)),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
! [X0] : ~ a(X0,X0),
inference(cnf_transformation,[],[f6]) ).
cnf(c_49,negated_conjecture,
~ a(X0,X0),
inference(cnf_transformation,[],[f9]) ).
cnf(c_50,negated_conjecture,
a(sK0(X0),sK0(X0)),
inference(cnf_transformation,[],[f8]) ).
cnf(c_57,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_50,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SYN948+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 21:19:01 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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
% 0.78/1.21 % SZS status Started for theBenchmark.p
% 0.78/1.21 % SZS status Theorem for theBenchmark.p
% 0.78/1.21
% 0.78/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.78/1.21
% 0.78/1.21 ------ iProver source info
% 0.78/1.21
% 0.78/1.21 git: date: 2024-05-02 19:28:25 +0000
% 0.78/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.78/1.21 git: non_committed_changes: false
% 0.78/1.21
% 0.78/1.21 ------ Parsing...
% 0.78/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.78/1.21
% 0.78/1.21 ------ Preprocessing...
% 0.78/1.21
% 0.78/1.21 % SZS status Theorem for theBenchmark.p
% 0.78/1.21
% 0.78/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.78/1.21
% 0.78/1.21
%------------------------------------------------------------------------------