TSTP Solution File: SYN073+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN073+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:29:09 EDT 2024
% Result : Theorem 1.67s 1.17s
% Output : CNFRefutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 11 ~; 10 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 31 ( 3 sgn 19 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
( ! [X1] : big_f(X0,X1)
| big_f(a,X0) )
=> ? [X2] :
! [X3] : big_f(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel50) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( ! [X1] : big_f(X0,X1)
| big_f(a,X0) )
=> ? [X2] :
! [X3] : big_f(X2,X3) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
( ! [X2] :
? [X3] : ~ big_f(X2,X3)
& ! [X0] :
( ! [X1] : big_f(X0,X1)
| big_f(a,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ! [X0] :
? [X1] : ~ big_f(X0,X1)
& ! [X2] :
( ! [X3] : big_f(X2,X3)
| big_f(a,X2) ) ),
inference(rectify,[],[f3]) ).
fof(f5,plain,
! [X0] :
( ? [X1] : ~ big_f(X0,X1)
=> ~ big_f(X0,sK0(X0)) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ! [X0] : ~ big_f(X0,sK0(X0))
& ! [X2] :
( ! [X3] : big_f(X2,X3)
| big_f(a,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f4,f5]) ).
fof(f7,plain,
! [X2,X3] :
( big_f(X2,X3)
| big_f(a,X2) ),
inference(cnf_transformation,[],[f6]) ).
fof(f8,plain,
! [X0] : ~ big_f(X0,sK0(X0)),
inference(cnf_transformation,[],[f6]) ).
cnf(c_49,negated_conjecture,
~ big_f(X0,sK0(X0)),
inference(cnf_transformation,[],[f8]) ).
cnf(c_50,negated_conjecture,
( big_f(X0,X1)
| big_f(a,X0) ),
inference(cnf_transformation,[],[f7]) ).
cnf(c_51,plain,
~ big_f(a,sK0(a)),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_59,negated_conjecture,
( big_f(X0,X1)
| big_f(a,X0) ),
inference(demodulation,[status(thm)],[c_50]) ).
cnf(c_60,negated_conjecture,
~ big_f(X0,sK0(X0)),
inference(demodulation,[status(thm)],[c_49]) ).
cnf(c_61,plain,
( big_f(sK0(a),X0)
| big_f(a,sK0(a)) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_65,plain,
( big_f(sK0(a),sK0(sK0(a)))
| big_f(a,sK0(a)) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_66,plain,
~ big_f(sK0(a),sK0(sK0(a))),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_67,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_66,c_65,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SYN073+1 : TPTP v8.1.2. Released v2.0.0.
% 0.08/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n029.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 : Thu May 2 21:20:52 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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.67/1.17 % SZS status Started for theBenchmark.p
% 1.67/1.17 % SZS status Theorem for theBenchmark.p
% 1.67/1.17
% 1.67/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.67/1.17
% 1.67/1.17 ------ iProver source info
% 1.67/1.17
% 1.67/1.17 git: date: 2024-05-02 19:28:25 +0000
% 1.67/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.67/1.17 git: non_committed_changes: false
% 1.67/1.17
% 1.67/1.17 ------ Parsing...
% 1.67/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.67/1.17
% 1.67/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.67/1.17
% 1.67/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.67/1.17 ------ Proving...
% 1.67/1.17 ------ Problem Properties
% 1.67/1.17
% 1.67/1.17
% 1.67/1.17 clauses 2
% 1.67/1.17 conjectures 2
% 1.67/1.17 EPR 1
% 1.67/1.17 Horn 1
% 1.67/1.17 unary 1
% 1.67/1.17 binary 1
% 1.67/1.17 lits 3
% 1.67/1.17 lits eq 0
% 1.67/1.17 fd_pure 0
% 1.67/1.17 fd_pseudo 0
% 1.67/1.17 fd_cond 0
% 1.67/1.17 fd_pseudo_cond 0
% 1.67/1.17 AC symbols 0
% 1.67/1.17
% 1.67/1.17 ------ Schedule dynamic 5 is on
% 1.67/1.17
% 1.67/1.17 ------ no equalities: superposition off
% 1.67/1.17
% 1.67/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.67/1.17
% 1.67/1.17
% 1.67/1.17 ------
% 1.67/1.17 Current options:
% 1.67/1.17 ------
% 1.67/1.17
% 1.67/1.17
% 1.67/1.17
% 1.67/1.17
% 1.67/1.17 ------ Proving...
% 1.67/1.17
% 1.67/1.17
% 1.67/1.17 % SZS status Theorem for theBenchmark.p
% 1.67/1.17
% 1.67/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.67/1.17
% 1.67/1.17
%------------------------------------------------------------------------------