TSTP Solution File: SEU430+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU430+1 : TPTP v8.1.2. Released v3.4.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 : Thu Aug 31 17:07:15 EDT 2023
% Result : Theorem 0.51s 1.20s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 67 ( 13 unt; 0 def)
% Number of atoms : 233 ( 87 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 257 ( 91 ~; 101 |; 48 &)
% ( 5 <=>; 11 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 128 ( 3 sgn; 75 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
( m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X0)))
=> ( k5_setfam_1(X0,X1) = k1_xboole_0
<=> ! [X2] :
( r2_hidden(X2,X1)
=> k1_xboole_0 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t30_relset_2) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
( m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X0)))
=> ( k5_setfam_1(X0,X1) = k1_xboole_0
<=> ! [X2] :
( r2_hidden(X2,X1)
=> k1_xboole_0 = X2 ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f5,axiom,
! [X0] :
( k1_xboole_0 = X0
<=> ! [X1] : ~ r2_hidden(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f6,axiom,
! [X0,X1] :
( k3_tarski(X0) = X1
<=> ! [X2] :
( r2_hidden(X2,X1)
<=> ? [X3] :
( r2_hidden(X3,X0)
& r2_hidden(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
fof(f21,axiom,
! [X0,X1] :
( m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X0)))
=> k5_setfam_1(X0,X1) = k3_tarski(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k5_setfam_1) ).
fof(f41,plain,
? [X0,X1] :
( ( k5_setfam_1(X0,X1) = k1_xboole_0
<~> ! [X2] :
( k1_xboole_0 = X2
| ~ r2_hidden(X2,X1) ) )
& m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X0))) ),
inference(ennf_transformation,[],[f2]) ).
fof(f45,plain,
! [X0,X1] :
( k5_setfam_1(X0,X1) = k3_tarski(X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X0))) ),
inference(ennf_transformation,[],[f21]) ).
fof(f56,plain,
? [X0,X1] :
( ( ? [X2] :
( k1_xboole_0 != X2
& r2_hidden(X2,X1) )
| k5_setfam_1(X0,X1) != k1_xboole_0 )
& ( ! [X2] :
( k1_xboole_0 = X2
| ~ r2_hidden(X2,X1) )
| k5_setfam_1(X0,X1) = k1_xboole_0 )
& m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X0))) ),
inference(nnf_transformation,[],[f41]) ).
fof(f57,plain,
? [X0,X1] :
( ( ? [X2] :
( k1_xboole_0 != X2
& r2_hidden(X2,X1) )
| k5_setfam_1(X0,X1) != k1_xboole_0 )
& ( ! [X2] :
( k1_xboole_0 = X2
| ~ r2_hidden(X2,X1) )
| k5_setfam_1(X0,X1) = k1_xboole_0 )
& m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X0))) ),
inference(flattening,[],[f56]) ).
fof(f58,plain,
? [X0,X1] :
( ( ? [X2] :
( k1_xboole_0 != X2
& r2_hidden(X2,X1) )
| k5_setfam_1(X0,X1) != k1_xboole_0 )
& ( ! [X3] :
( k1_xboole_0 = X3
| ~ r2_hidden(X3,X1) )
| k5_setfam_1(X0,X1) = k1_xboole_0 )
& m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X0))) ),
inference(rectify,[],[f57]) ).
fof(f59,plain,
( ? [X0,X1] :
( ( ? [X2] :
( k1_xboole_0 != X2
& r2_hidden(X2,X1) )
| k5_setfam_1(X0,X1) != k1_xboole_0 )
& ( ! [X3] :
( k1_xboole_0 = X3
| ~ r2_hidden(X3,X1) )
| k5_setfam_1(X0,X1) = k1_xboole_0 )
& m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X0))) )
=> ( ( ? [X2] :
( k1_xboole_0 != X2
& r2_hidden(X2,sK1) )
| k1_xboole_0 != k5_setfam_1(sK0,sK1) )
& ( ! [X3] :
( k1_xboole_0 = X3
| ~ r2_hidden(X3,sK1) )
| k1_xboole_0 = k5_setfam_1(sK0,sK1) )
& m1_subset_1(sK1,k1_zfmisc_1(k1_zfmisc_1(sK0))) ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
( ? [X2] :
( k1_xboole_0 != X2
& r2_hidden(X2,sK1) )
=> ( k1_xboole_0 != sK2
& r2_hidden(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f61,plain,
( ( ( k1_xboole_0 != sK2
& r2_hidden(sK2,sK1) )
| k1_xboole_0 != k5_setfam_1(sK0,sK1) )
& ( ! [X3] :
( k1_xboole_0 = X3
| ~ r2_hidden(X3,sK1) )
| k1_xboole_0 = k5_setfam_1(sK0,sK1) )
& m1_subset_1(sK1,k1_zfmisc_1(k1_zfmisc_1(sK0))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f58,f60,f59]) ).
fof(f62,plain,
! [X0] :
( ( k1_xboole_0 = X0
| ? [X1] : r2_hidden(X1,X0) )
& ( ! [X1] : ~ r2_hidden(X1,X0)
| k1_xboole_0 != X0 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f63,plain,
! [X0] :
( ( k1_xboole_0 = X0
| ? [X1] : r2_hidden(X1,X0) )
& ( ! [X2] : ~ r2_hidden(X2,X0)
| k1_xboole_0 != X0 ) ),
inference(rectify,[],[f62]) ).
fof(f64,plain,
! [X0] :
( ? [X1] : r2_hidden(X1,X0)
=> r2_hidden(sK3(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f65,plain,
! [X0] :
( ( k1_xboole_0 = X0
| r2_hidden(sK3(X0),X0) )
& ( ! [X2] : ~ r2_hidden(X2,X0)
| k1_xboole_0 != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f63,f64]) ).
fof(f66,plain,
! [X0,X1] :
( ( k3_tarski(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ r2_hidden(X3,X0)
| ~ r2_hidden(X2,X3) )
| ~ r2_hidden(X2,X1) )
& ( ? [X3] :
( r2_hidden(X3,X0)
& r2_hidden(X2,X3) )
| r2_hidden(X2,X1) ) ) )
& ( ! [X2] :
( ( r2_hidden(X2,X1)
| ! [X3] :
( ~ r2_hidden(X3,X0)
| ~ r2_hidden(X2,X3) ) )
& ( ? [X3] :
( r2_hidden(X3,X0)
& r2_hidden(X2,X3) )
| ~ r2_hidden(X2,X1) ) )
| k3_tarski(X0) != X1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f67,plain,
! [X0,X1] :
( ( k3_tarski(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ r2_hidden(X3,X0)
| ~ r2_hidden(X2,X3) )
| ~ r2_hidden(X2,X1) )
& ( ? [X4] :
( r2_hidden(X4,X0)
& r2_hidden(X2,X4) )
| r2_hidden(X2,X1) ) ) )
& ( ! [X5] :
( ( r2_hidden(X5,X1)
| ! [X6] :
( ~ r2_hidden(X6,X0)
| ~ r2_hidden(X5,X6) ) )
& ( ? [X7] :
( r2_hidden(X7,X0)
& r2_hidden(X5,X7) )
| ~ r2_hidden(X5,X1) ) )
| k3_tarski(X0) != X1 ) ),
inference(rectify,[],[f66]) ).
fof(f68,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] :
( ~ r2_hidden(X3,X0)
| ~ r2_hidden(X2,X3) )
| ~ r2_hidden(X2,X1) )
& ( ? [X4] :
( r2_hidden(X4,X0)
& r2_hidden(X2,X4) )
| r2_hidden(X2,X1) ) )
=> ( ( ! [X3] :
( ~ r2_hidden(X3,X0)
| ~ r2_hidden(sK4(X0,X1),X3) )
| ~ r2_hidden(sK4(X0,X1),X1) )
& ( ? [X4] :
( r2_hidden(X4,X0)
& r2_hidden(sK4(X0,X1),X4) )
| r2_hidden(sK4(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f69,plain,
! [X0,X1] :
( ? [X4] :
( r2_hidden(X4,X0)
& r2_hidden(sK4(X0,X1),X4) )
=> ( r2_hidden(sK5(X0,X1),X0)
& r2_hidden(sK4(X0,X1),sK5(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f70,plain,
! [X0,X5] :
( ? [X7] :
( r2_hidden(X7,X0)
& r2_hidden(X5,X7) )
=> ( r2_hidden(sK6(X0,X5),X0)
& r2_hidden(X5,sK6(X0,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f71,plain,
! [X0,X1] :
( ( k3_tarski(X0) = X1
| ( ( ! [X3] :
( ~ r2_hidden(X3,X0)
| ~ r2_hidden(sK4(X0,X1),X3) )
| ~ r2_hidden(sK4(X0,X1),X1) )
& ( ( r2_hidden(sK5(X0,X1),X0)
& r2_hidden(sK4(X0,X1),sK5(X0,X1)) )
| r2_hidden(sK4(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( r2_hidden(X5,X1)
| ! [X6] :
( ~ r2_hidden(X6,X0)
| ~ r2_hidden(X5,X6) ) )
& ( ( r2_hidden(sK6(X0,X5),X0)
& r2_hidden(X5,sK6(X0,X5)) )
| ~ r2_hidden(X5,X1) ) )
| k3_tarski(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f67,f70,f69,f68]) ).
fof(f82,plain,
m1_subset_1(sK1,k1_zfmisc_1(k1_zfmisc_1(sK0))),
inference(cnf_transformation,[],[f61]) ).
fof(f83,plain,
! [X3] :
( k1_xboole_0 = X3
| ~ r2_hidden(X3,sK1)
| k1_xboole_0 = k5_setfam_1(sK0,sK1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f84,plain,
( r2_hidden(sK2,sK1)
| k1_xboole_0 != k5_setfam_1(sK0,sK1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f85,plain,
( k1_xboole_0 != sK2
| k1_xboole_0 != k5_setfam_1(sK0,sK1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f87,plain,
! [X2,X0] :
( ~ r2_hidden(X2,X0)
| k1_xboole_0 != X0 ),
inference(cnf_transformation,[],[f65]) ).
fof(f88,plain,
! [X0] :
( k1_xboole_0 = X0
| r2_hidden(sK3(X0),X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f90,plain,
! [X0,X1,X5] :
( r2_hidden(sK6(X0,X5),X0)
| ~ r2_hidden(X5,X1)
| k3_tarski(X0) != X1 ),
inference(cnf_transformation,[],[f71]) ).
fof(f91,plain,
! [X0,X1,X6,X5] :
( r2_hidden(X5,X1)
| ~ r2_hidden(X6,X0)
| ~ r2_hidden(X5,X6)
| k3_tarski(X0) != X1 ),
inference(cnf_transformation,[],[f71]) ).
fof(f92,plain,
! [X0,X1] :
( k3_tarski(X0) = X1
| r2_hidden(sK4(X0,X1),sK5(X0,X1))
| r2_hidden(sK4(X0,X1),X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f93,plain,
! [X0,X1] :
( k3_tarski(X0) = X1
| r2_hidden(sK5(X0,X1),X0)
| r2_hidden(sK4(X0,X1),X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f106,plain,
! [X0,X1] :
( k5_setfam_1(X0,X1) = k3_tarski(X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X0))) ),
inference(cnf_transformation,[],[f45]) ).
fof(f116,plain,
! [X2] : ~ r2_hidden(X2,k1_xboole_0),
inference(equality_resolution,[],[f87]) ).
fof(f117,plain,
! [X0,X6,X5] :
( r2_hidden(X5,k3_tarski(X0))
| ~ r2_hidden(X6,X0)
| ~ r2_hidden(X5,X6) ),
inference(equality_resolution,[],[f91]) ).
fof(f118,plain,
! [X0,X5] :
( r2_hidden(sK6(X0,X5),X0)
| ~ r2_hidden(X5,k3_tarski(X0)) ),
inference(equality_resolution,[],[f90]) ).
cnf(c_49,negated_conjecture,
( k5_setfam_1(sK0,sK1) != k1_xboole_0
| k1_xboole_0 != sK2 ),
inference(cnf_transformation,[],[f85]) ).
cnf(c_50,negated_conjecture,
( k5_setfam_1(sK0,sK1) != k1_xboole_0
| r2_hidden(sK2,sK1) ),
inference(cnf_transformation,[],[f84]) ).
cnf(c_51,negated_conjecture,
( ~ r2_hidden(X0,sK1)
| k5_setfam_1(sK0,sK1) = k1_xboole_0
| X0 = k1_xboole_0 ),
inference(cnf_transformation,[],[f83]) ).
cnf(c_52,negated_conjecture,
m1_subset_1(sK1,k1_zfmisc_1(k1_zfmisc_1(sK0))),
inference(cnf_transformation,[],[f82]) ).
cnf(c_54,plain,
( X0 = k1_xboole_0
| r2_hidden(sK3(X0),X0) ),
inference(cnf_transformation,[],[f88]) ).
cnf(c_55,plain,
~ r2_hidden(X0,k1_xboole_0),
inference(cnf_transformation,[],[f116]) ).
cnf(c_57,plain,
( k3_tarski(X0) = X1
| r2_hidden(sK4(X0,X1),X1)
| r2_hidden(sK5(X0,X1),X0) ),
inference(cnf_transformation,[],[f93]) ).
cnf(c_58,plain,
( k3_tarski(X0) = X1
| r2_hidden(sK4(X0,X1),sK5(X0,X1))
| r2_hidden(sK4(X0,X1),X1) ),
inference(cnf_transformation,[],[f92]) ).
cnf(c_59,plain,
( ~ r2_hidden(X0,X1)
| ~ r2_hidden(X1,X2)
| r2_hidden(X0,k3_tarski(X2)) ),
inference(cnf_transformation,[],[f117]) ).
cnf(c_60,plain,
( ~ r2_hidden(X0,k3_tarski(X1))
| r2_hidden(sK6(X1,X0),X1) ),
inference(cnf_transformation,[],[f118]) ).
cnf(c_73,plain,
( ~ m1_subset_1(X0,k1_zfmisc_1(k1_zfmisc_1(X1)))
| k5_setfam_1(X1,X0) = k3_tarski(X0) ),
inference(cnf_transformation,[],[f106]) ).
cnf(c_1078,plain,
~ r2_hidden(X0,k3_tarski(k1_xboole_0)),
inference(superposition,[status(thm)],[c_60,c_55]) ).
cnf(c_1120,plain,
k3_tarski(k1_xboole_0) = k1_xboole_0,
inference(superposition,[status(thm)],[c_54,c_1078]) ).
cnf(c_1571,plain,
k5_setfam_1(sK0,sK1) = k3_tarski(sK1),
inference(superposition,[status(thm)],[c_52,c_73]) ).
cnf(c_1588,plain,
( ~ r2_hidden(X0,sK1)
| k3_tarski(sK1) = k1_xboole_0
| X0 = k1_xboole_0 ),
inference(demodulation,[status(thm)],[c_51,c_1571]) ).
cnf(c_1589,plain,
( k3_tarski(sK1) != k1_xboole_0
| k1_xboole_0 != sK2 ),
inference(demodulation,[status(thm)],[c_49,c_1571]) ).
cnf(c_1590,plain,
( k3_tarski(sK1) != k1_xboole_0
| r2_hidden(sK2,sK1) ),
inference(demodulation,[status(thm)],[c_50,c_1571]) ).
cnf(c_1641,plain,
( k3_tarski(k1_xboole_0) = X0
| r2_hidden(sK4(k1_xboole_0,X0),X0) ),
inference(superposition,[status(thm)],[c_57,c_55]) ).
cnf(c_1651,plain,
( X0 = k1_xboole_0
| r2_hidden(sK4(k1_xboole_0,X0),X0) ),
inference(light_normalisation,[status(thm)],[c_1641,c_1120]) ).
cnf(c_1886,plain,
( sK5(sK1,X0) = k1_xboole_0
| k3_tarski(sK1) = X0
| k3_tarski(sK1) = k1_xboole_0
| r2_hidden(sK4(sK1,X0),X0) ),
inference(superposition,[status(thm)],[c_57,c_1588]) ).
cnf(c_2902,plain,
( sK5(sK1,k1_xboole_0) = k1_xboole_0
| k3_tarski(sK1) = k1_xboole_0 ),
inference(superposition,[status(thm)],[c_1886,c_55]) ).
cnf(c_3831,plain,
( k3_tarski(sK1) = k1_xboole_0
| r2_hidden(sK4(sK1,k1_xboole_0),k1_xboole_0) ),
inference(superposition,[status(thm)],[c_2902,c_58]) ).
cnf(c_3833,plain,
k3_tarski(sK1) = k1_xboole_0,
inference(forward_subsumption_resolution,[status(thm)],[c_3831,c_55]) ).
cnf(c_3834,plain,
r2_hidden(sK2,sK1),
inference(backward_subsumption_resolution,[status(thm)],[c_1590,c_3833]) ).
cnf(c_3835,plain,
k1_xboole_0 != sK2,
inference(backward_subsumption_resolution,[status(thm)],[c_1589,c_3833]) ).
cnf(c_3865,plain,
( ~ r2_hidden(X0,sK2)
| r2_hidden(X0,k3_tarski(sK1)) ),
inference(superposition,[status(thm)],[c_3834,c_59]) ).
cnf(c_3879,plain,
( ~ r2_hidden(X0,sK2)
| r2_hidden(X0,k1_xboole_0) ),
inference(light_normalisation,[status(thm)],[c_3865,c_3833]) ).
cnf(c_3880,plain,
~ r2_hidden(X0,sK2),
inference(forward_subsumption_resolution,[status(thm)],[c_3879,c_55]) ).
cnf(c_3894,plain,
k1_xboole_0 = sK2,
inference(superposition,[status(thm)],[c_1651,c_3880]) ).
cnf(c_3895,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3894,c_3835]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU430+1 : TPTP v8.1.2. Released v3.4.0.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n031.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 24 01:50:05 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.51/1.20 % SZS status Started for theBenchmark.p
% 0.51/1.20 % SZS status Theorem for theBenchmark.p
% 0.51/1.20
% 0.51/1.20 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.51/1.20
% 0.51/1.20 ------ iProver source info
% 0.51/1.20
% 0.51/1.20 git: date: 2023-05-31 18:12:56 +0000
% 0.51/1.20 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.51/1.20 git: non_committed_changes: false
% 0.51/1.20 git: last_make_outside_of_git: false
% 0.51/1.20
% 0.51/1.20 ------ Parsing...
% 0.51/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.51/1.20
% 0.51/1.20 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.51/1.20
% 0.51/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.51/1.20
% 0.51/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.51/1.20 ------ Proving...
% 0.51/1.20 ------ Problem Properties
% 0.51/1.20
% 0.51/1.20
% 0.51/1.20 clauses 32
% 0.51/1.20 conjectures 4
% 0.51/1.20 EPR 10
% 0.51/1.20 Horn 26
% 0.51/1.20 unary 10
% 0.51/1.20 binary 13
% 0.51/1.20 lits 64
% 0.51/1.20 lits eq 12
% 0.51/1.20 fd_pure 0
% 0.51/1.20 fd_pseudo 0
% 0.51/1.20 fd_cond 3
% 0.51/1.20 fd_pseudo_cond 4
% 0.51/1.20 AC symbols 0
% 0.51/1.20
% 0.51/1.20 ------ Schedule dynamic 5 is on
% 0.51/1.20
% 0.51/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.51/1.20
% 0.51/1.20
% 0.51/1.20 ------
% 0.51/1.20 Current options:
% 0.51/1.20 ------
% 0.51/1.20
% 0.51/1.20
% 0.51/1.20
% 0.51/1.20
% 0.51/1.20 ------ Proving...
% 0.51/1.20
% 0.51/1.20
% 0.51/1.20 % SZS status Theorem for theBenchmark.p
% 0.51/1.20
% 0.51/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.51/1.20
% 0.51/1.20
%------------------------------------------------------------------------------