TSTP Solution File: SYN336+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN336+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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 Sep 1 03:06:28 EDT 2023
% Result : Theorem 0.69s 1.18s
% Output : CNFRefutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 5 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 48 ( 10 ~; 0 |; 28 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 34 ( 2 sgn; 19 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
? [X1,X2] :
! [X3] :
( big_f(X0,X3)
=> ( big_f(X1,X3)
=> ( big_f(X2,X3)
=> ( big_f(X1,X0)
=> big_f(X3,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_15_1) ).
fof(f2,negated_conjecture,
~ ! [X0] :
? [X1,X2] :
! [X3] :
( big_f(X0,X3)
=> ( big_f(X1,X3)
=> ( big_f(X2,X3)
=> ( big_f(X1,X0)
=> big_f(X3,X2) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
? [X0] :
! [X1,X2] :
? [X3] :
( ~ big_f(X3,X2)
& big_f(X1,X0)
& big_f(X2,X3)
& big_f(X1,X3)
& big_f(X0,X3) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0] :
! [X1,X2] :
? [X3] :
( ~ big_f(X3,X2)
& big_f(X1,X0)
& big_f(X2,X3)
& big_f(X1,X3)
& big_f(X0,X3) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
( ? [X0] :
! [X1,X2] :
? [X3] :
( ~ big_f(X3,X2)
& big_f(X1,X0)
& big_f(X2,X3)
& big_f(X1,X3)
& big_f(X0,X3) )
=> ! [X2,X1] :
? [X3] :
( ~ big_f(X3,X2)
& big_f(X1,sK0)
& big_f(X2,X3)
& big_f(X1,X3)
& big_f(sK0,X3) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
! [X1,X2] :
( ? [X3] :
( ~ big_f(X3,X2)
& big_f(X1,sK0)
& big_f(X2,X3)
& big_f(X1,X3)
& big_f(sK0,X3) )
=> ( ~ big_f(sK1(X1,X2),X2)
& big_f(X1,sK0)
& big_f(X2,sK1(X1,X2))
& big_f(X1,sK1(X1,X2))
& big_f(sK0,sK1(X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
! [X1,X2] :
( ~ big_f(sK1(X1,X2),X2)
& big_f(X1,sK0)
& big_f(X2,sK1(X1,X2))
& big_f(X1,sK1(X1,X2))
& big_f(sK0,sK1(X1,X2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f4,f6,f5]) ).
fof(f11,plain,
! [X1] : big_f(X1,sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
! [X2,X1] : ~ big_f(sK1(X1,X2),X2),
inference(cnf_transformation,[],[f7]) ).
cnf(c_49,negated_conjecture,
~ big_f(sK1(X0,X1),X1),
inference(cnf_transformation,[],[f12]) ).
cnf(c_50,negated_conjecture,
big_f(X0,sK0),
inference(cnf_transformation,[],[f11]) ).
cnf(c_67,plain,
$false,
inference(resolution,[status(thm)],[c_49,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN336+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 19:28:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.69/1.18 % SZS status Started for theBenchmark.p
% 0.69/1.18 % SZS status Theorem for theBenchmark.p
% 0.69/1.18
% 0.69/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.69/1.18
% 0.69/1.18 ------ iProver source info
% 0.69/1.18
% 0.69/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.69/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.69/1.18 git: non_committed_changes: false
% 0.69/1.18 git: last_make_outside_of_git: false
% 0.69/1.18
% 0.69/1.18 ------ Parsing...
% 0.69/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.69/1.18
% 0.69/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s
% 0.69/1.18
% 0.69/1.18 % SZS status Theorem for theBenchmark.p
% 0.69/1.18
% 0.69/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.69/1.18
% 0.69/1.18
%------------------------------------------------------------------------------