TSTP Solution File: SYN356+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN356+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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:38 EDT 2023
% Result : Theorem 1.15s 1.05s
% Output : CNFRefutation 1.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 63 ( 20 ~; 14 |; 20 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 32 ( 1 sgn; 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X2,X3] :
( big_q(X2,X3)
=> big_q(X2,X2) )
& ! [X0,X1] :
( big_r(X0,X1)
=> ( big_q(X0,X1)
& big_r(X1,X0) ) )
& big_r(a,b) )
=> ( big_q(b,b)
& big_q(a,a) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2107) ).
fof(f2,negated_conjecture,
~ ( ( ! [X2,X3] :
( big_q(X2,X3)
=> big_q(X2,X2) )
& ! [X0,X1] :
( big_r(X0,X1)
=> ( big_q(X0,X1)
& big_r(X1,X0) ) )
& big_r(a,b) )
=> ( big_q(b,b)
& big_q(a,a) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ! [X0,X1] :
( big_q(X0,X1)
=> big_q(X0,X0) )
& ! [X2,X3] :
( big_r(X2,X3)
=> ( big_q(X2,X3)
& big_r(X3,X2) ) )
& big_r(a,b) )
=> ( big_q(b,b)
& big_q(a,a) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ( ~ big_q(b,b)
| ~ big_q(a,a) )
& ! [X0,X1] :
( big_q(X0,X0)
| ~ big_q(X0,X1) )
& ! [X2,X3] :
( ( big_q(X2,X3)
& big_r(X3,X2) )
| ~ big_r(X2,X3) )
& big_r(a,b) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ~ big_q(b,b)
| ~ big_q(a,a) )
& ! [X0,X1] :
( big_q(X0,X0)
| ~ big_q(X0,X1) )
& ! [X2,X3] :
( ( big_q(X2,X3)
& big_r(X3,X2) )
| ~ big_r(X2,X3) )
& big_r(a,b) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
big_r(a,b),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
! [X2,X3] :
( big_r(X3,X2)
| ~ big_r(X2,X3) ),
inference(cnf_transformation,[],[f5]) ).
fof(f8,plain,
! [X2,X3] :
( big_q(X2,X3)
| ~ big_r(X2,X3) ),
inference(cnf_transformation,[],[f5]) ).
fof(f9,plain,
! [X0,X1] :
( big_q(X0,X0)
| ~ big_q(X0,X1) ),
inference(cnf_transformation,[],[f5]) ).
fof(f10,plain,
( ~ big_q(b,b)
| ~ big_q(a,a) ),
inference(cnf_transformation,[],[f5]) ).
cnf(c_49,negated_conjecture,
( ~ big_q(b,b)
| ~ big_q(a,a) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_50,negated_conjecture,
( ~ big_q(X0,X1)
| big_q(X0,X0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_51,negated_conjecture,
( ~ big_r(X0,X1)
| big_q(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_52,negated_conjecture,
( ~ big_r(X0,X1)
| big_r(X1,X0) ),
inference(cnf_transformation,[],[f7]) ).
cnf(c_53,negated_conjecture,
big_r(a,b),
inference(cnf_transformation,[],[f6]) ).
cnf(c_55,plain,
big_q(a,b),
inference(resolution,[status(thm)],[c_51,c_53]) ).
cnf(c_56,plain,
big_r(b,a),
inference(resolution,[status(thm)],[c_52,c_53]) ).
cnf(c_57,plain,
big_q(a,a),
inference(resolution,[status(thm)],[c_55,c_50]) ).
cnf(c_59,plain,
big_q(b,a),
inference(resolution,[status(thm)],[c_56,c_51]) ).
cnf(c_61,plain,
big_q(b,b),
inference(resolution,[status(thm)],[c_59,c_50]) ).
cnf(c_62,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_61,c_57,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN356+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Sat Aug 26 20:33:44 EDT 2023
% 0.11/0.30 % CPUTime :
% 0.15/0.39 Running first-order theorem proving
% 0.15/0.39 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.15/1.05 % SZS status Started for theBenchmark.p
% 1.15/1.05 % SZS status Theorem for theBenchmark.p
% 1.15/1.05
% 1.15/1.05 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.15/1.05
% 1.15/1.05 ------ iProver source info
% 1.15/1.05
% 1.15/1.05 git: date: 2023-05-31 18:12:56 +0000
% 1.15/1.05 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.15/1.05 git: non_committed_changes: false
% 1.15/1.05 git: last_make_outside_of_git: false
% 1.15/1.05
% 1.15/1.05 ------ Parsing...
% 1.15/1.05 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 1.15/1.05
% 1.15/1.05
% 1.15/1.05 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.15/1.05
% 1.15/1.05 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.15/1.05 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.15/1.05 ------ Proving...
% 1.15/1.05 ------ Problem Properties
% 1.15/1.05
% 1.15/1.05
% 1.15/1.05 clauses 5
% 1.15/1.05 conjectures 5
% 1.15/1.05 EPR 5
% 1.15/1.05 Horn 5
% 1.15/1.05 unary 1
% 1.15/1.05 binary 4
% 1.15/1.05 lits 9
% 1.15/1.05 lits eq 0
% 1.15/1.05 fd_pure 0
% 1.15/1.05 fd_pseudo 0
% 1.15/1.05 fd_cond 0
% 1.15/1.05 fd_pseudo_cond 0
% 1.15/1.05 AC symbols 0
% 1.15/1.05
% 1.15/1.05 ------ Schedule EPR Horn non eq is on
% 1.15/1.05
% 1.15/1.05 ------ no equalities: superposition off
% 1.15/1.05
% 1.15/1.05 ------ Option_epr_horn Time Limit: Unbounded
% 1.15/1.05
% 1.15/1.05
% 1.15/1.05 ------
% 1.15/1.05 Current options:
% 1.15/1.05 ------
% 1.15/1.05
% 1.15/1.05
% 1.15/1.05
% 1.15/1.05
% 1.15/1.05 ------ Proving...
% 1.15/1.05
% 1.15/1.05
% 1.15/1.05 % SZS status Theorem for theBenchmark.p
% 1.15/1.05
% 1.15/1.05 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.15/1.05
% 1.15/1.05
%------------------------------------------------------------------------------