TSTP Solution File: SWW101+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWW101+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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 : Mon Jun 24 18:16:20 EDT 2024
% Result : Theorem 0.48s 1.15s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of formulae : 88 ( 47 unt; 0 def)
% Number of atoms : 173 ( 91 equ)
% Maximal formula atoms : 9 ( 1 avg)
% Number of connectives : 145 ( 60 ~; 51 |; 28 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 59 ( 1 sgn 45 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( bool(X0)
<=> ( true = X0
| false = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_bool) ).
fof(f3,axiom,
( d(err)
& d(false)
& d(true) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',false_true_err_in_d) ).
fof(f4,axiom,
! [X0,X1] :
( forallprefers(X0,X1)
<=> ( ( true = X1
& false = X0 )
| ( bool(X1)
& ~ bool(X0)
& d(X1)
& d(X0) )
| ( d(X1)
& ~ d(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_forallprefers) ).
fof(f6,axiom,
! [X0] :
( ( err = phi(X0)
& ~ d(X0) )
| ( phi(X0) = X0
& d(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_phi) ).
fof(f7,axiom,
! [X0] :
( true = prop(X0)
<=> bool(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prop_true) ).
fof(f8,axiom,
! [X0] :
( false = prop(X0)
<=> ~ bool(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prop_false) ).
fof(f14,axiom,
! [X3] : true = lazy_impl(false,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lazy_impl_axiom2) ).
fof(f15,axiom,
! [X3] : phi(X3) = lazy_impl(true,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lazy_impl_axiom3) ).
fof(f38,axiom,
false = false1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_false1) ).
fof(f39,axiom,
! [X4] : f7(X4) = lazy_impl(prop(X4),X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_f7) ).
fof(f40,axiom,
? [X4] :
( ~ ? [X9] : forallprefers(f7(X9),f7(X4))
& false2 = phi(f7(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_false2) ).
fof(f45,conjecture,
false1 = false2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',false1_false2) ).
fof(f46,negated_conjecture,
false1 != false2,
inference(negated_conjecture,[],[f45]) ).
fof(f52,plain,
! [X0] : true = lazy_impl(false,X0),
inference(rectify,[],[f14]) ).
fof(f53,plain,
! [X0] : phi(X0) = lazy_impl(true,X0),
inference(rectify,[],[f15]) ).
fof(f76,plain,
! [X0] : f7(X0) = lazy_impl(prop(X0),X0),
inference(rectify,[],[f39]) ).
fof(f77,plain,
? [X0] :
( ~ ? [X1] : forallprefers(f7(X1),f7(X0))
& false2 = phi(f7(X0)) ),
inference(rectify,[],[f40]) ).
fof(f80,plain,
false1 != false2,
inference(flattening,[],[f46]) ).
fof(f82,plain,
! [X0,X1] :
( ( ( true = X1
& false = X0 )
| ( bool(X1)
& ~ bool(X0)
& d(X1)
& d(X0) )
| ( d(X1)
& ~ d(X0) ) )
=> forallprefers(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f83,plain,
! [X0,X1] :
( forallprefers(X0,X1)
| ( ( true != X1
| false != X0 )
& ( ~ bool(X1)
| bool(X0)
| ~ d(X1)
| ~ d(X0) )
& ( ~ d(X1)
| d(X0) ) ) ),
inference(ennf_transformation,[],[f82]) ).
fof(f108,plain,
? [X0] :
( ! [X1] : ~ forallprefers(f7(X1),f7(X0))
& false2 = phi(f7(X0)) ),
inference(ennf_transformation,[],[f77]) ).
fof(f110,plain,
! [X0] :
( ( bool(X0)
| ( true != X0
& false != X0 ) )
& ( true = X0
| false = X0
| ~ bool(X0) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f111,plain,
! [X0] :
( ( bool(X0)
| ( true != X0
& false != X0 ) )
& ( true = X0
| false = X0
| ~ bool(X0) ) ),
inference(flattening,[],[f110]) ).
fof(f112,plain,
! [X0] :
( ( true = prop(X0)
| ~ bool(X0) )
& ( bool(X0)
| true != prop(X0) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f113,plain,
! [X0] :
( ( false = prop(X0)
| bool(X0) )
& ( ~ bool(X0)
| false != prop(X0) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f126,plain,
( ? [X0] :
( ! [X1] : ~ forallprefers(f7(X1),f7(X0))
& false2 = phi(f7(X0)) )
=> ( ! [X1] : ~ forallprefers(f7(X1),f7(sK6))
& false2 = phi(f7(sK6)) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
( ! [X1] : ~ forallprefers(f7(X1),f7(sK6))
& false2 = phi(f7(sK6)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f108,f126]) ).
fof(f128,plain,
! [X0] :
( true = X0
| false = X0
| ~ bool(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f129,plain,
! [X0] :
( bool(X0)
| false != X0 ),
inference(cnf_transformation,[],[f111]) ).
fof(f134,plain,
d(true),
inference(cnf_transformation,[],[f3]) ).
fof(f135,plain,
d(false),
inference(cnf_transformation,[],[f3]) ).
fof(f139,plain,
! [X0,X1] :
( forallprefers(X0,X1)
| true != X1
| false != X0 ),
inference(cnf_transformation,[],[f83]) ).
fof(f144,plain,
! [X0] :
( ~ d(X0)
| phi(X0) = X0 ),
inference(cnf_transformation,[],[f6]) ).
fof(f147,plain,
! [X0] :
( bool(X0)
| true != prop(X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f148,plain,
! [X0] :
( true = prop(X0)
| ~ bool(X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f150,plain,
! [X0] :
( false = prop(X0)
| bool(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f156,plain,
! [X0] : true = lazy_impl(false,X0),
inference(cnf_transformation,[],[f52]) ).
fof(f157,plain,
! [X0] : phi(X0) = lazy_impl(true,X0),
inference(cnf_transformation,[],[f53]) ).
fof(f186,plain,
false = false1,
inference(cnf_transformation,[],[f38]) ).
fof(f187,plain,
! [X0] : f7(X0) = lazy_impl(prop(X0),X0),
inference(cnf_transformation,[],[f76]) ).
fof(f188,plain,
false2 = phi(f7(sK6)),
inference(cnf_transformation,[],[f127]) ).
fof(f189,plain,
! [X1] : ~ forallprefers(f7(X1),f7(sK6)),
inference(cnf_transformation,[],[f127]) ).
fof(f194,plain,
false1 != false2,
inference(cnf_transformation,[],[f80]) ).
fof(f202,plain,
! [X0] :
( bool(X0)
| false1 != X0 ),
inference(definition_unfolding,[],[f129,f186]) ).
fof(f203,plain,
! [X0] :
( true = X0
| false1 = X0
| ~ bool(X0) ),
inference(definition_unfolding,[],[f128,f186]) ).
fof(f206,plain,
d(false1),
inference(definition_unfolding,[],[f135,f186]) ).
fof(f207,plain,
! [X0,X1] :
( forallprefers(X0,X1)
| true != X1
| false1 != X0 ),
inference(definition_unfolding,[],[f139,f186]) ).
fof(f211,plain,
! [X0] :
( ~ d(X0)
| lazy_impl(true,X0) = X0 ),
inference(definition_unfolding,[],[f144,f157]) ).
fof(f212,plain,
! [X0] :
( prop(X0) = false1
| bool(X0) ),
inference(definition_unfolding,[],[f150,f186]) ).
fof(f218,plain,
! [X0] : true = lazy_impl(false1,X0),
inference(definition_unfolding,[],[f156,f186]) ).
fof(f233,plain,
! [X1] : ~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(sK6),sK6)),
inference(definition_unfolding,[],[f189,f187,f187]) ).
fof(f234,plain,
false2 = lazy_impl(true,lazy_impl(prop(sK6),sK6)),
inference(definition_unfolding,[],[f188,f157,f187]) ).
fof(f239,plain,
bool(false1),
inference(equality_resolution,[],[f202]) ).
fof(f240,plain,
! [X0] :
( forallprefers(X0,true)
| false1 != X0 ),
inference(equality_resolution,[],[f207]) ).
fof(f241,plain,
forallprefers(false1,true),
inference(equality_resolution,[],[f240]) ).
cnf(c_50,plain,
bool(false1),
inference(cnf_transformation,[],[f239]) ).
cnf(c_51,plain,
( ~ bool(X0)
| X0 = true
| X0 = false1 ),
inference(cnf_transformation,[],[f203]) ).
cnf(c_56,plain,
d(false1),
inference(cnf_transformation,[],[f206]) ).
cnf(c_57,plain,
d(true),
inference(cnf_transformation,[],[f134]) ).
cnf(c_58,plain,
forallprefers(false1,true),
inference(cnf_transformation,[],[f241]) ).
cnf(c_66,plain,
( ~ d(X0)
| lazy_impl(true,X0) = X0 ),
inference(cnf_transformation,[],[f211]) ).
cnf(c_67,plain,
( ~ bool(X0)
| prop(X0) = true ),
inference(cnf_transformation,[],[f148]) ).
cnf(c_68,plain,
( prop(X0) != true
| bool(X0) ),
inference(cnf_transformation,[],[f147]) ).
cnf(c_69,plain,
( prop(X0) = false1
| bool(X0) ),
inference(cnf_transformation,[],[f212]) ).
cnf(c_76,plain,
lazy_impl(false1,X0) = true,
inference(cnf_transformation,[],[f218]) ).
cnf(c_94,plain,
~ forallprefers(lazy_impl(prop(X0),X0),lazy_impl(prop(sK6),sK6)),
inference(cnf_transformation,[],[f233]) ).
cnf(c_95,plain,
lazy_impl(true,lazy_impl(prop(sK6),sK6)) = false2,
inference(cnf_transformation,[],[f234]) ).
cnf(c_99,negated_conjecture,
false1 != false2,
inference(cnf_transformation,[],[f194]) ).
cnf(c_822,negated_conjecture,
false1 != false2,
inference(demodulation,[status(thm)],[c_99]) ).
cnf(c_1730,plain,
prop(false1) = true,
inference(superposition,[status(thm)],[c_50,c_67]) ).
cnf(c_1731,plain,
( prop(X0) = true
| prop(X0) = false1 ),
inference(superposition,[status(thm)],[c_69,c_67]) ).
cnf(c_1745,plain,
lazy_impl(true,false1) = false1,
inference(superposition,[status(thm)],[c_56,c_66]) ).
cnf(c_1746,plain,
lazy_impl(true,true) = true,
inference(superposition,[status(thm)],[c_57,c_66]) ).
cnf(c_1991,plain,
~ forallprefers(lazy_impl(true,false1),lazy_impl(prop(sK6),sK6)),
inference(superposition,[status(thm)],[c_1730,c_94]) ).
cnf(c_1993,plain,
~ forallprefers(false1,lazy_impl(prop(sK6),sK6)),
inference(light_normalisation,[status(thm)],[c_1991,c_1745]) ).
cnf(c_2009,plain,
( ~ forallprefers(false1,lazy_impl(false1,sK6))
| prop(sK6) = true ),
inference(superposition,[status(thm)],[c_1731,c_1993]) ).
cnf(c_3416,plain,
( ~ forallprefers(false1,true)
| prop(sK6) = true ),
inference(demodulation,[status(thm)],[c_2009,c_76]) ).
cnf(c_3417,plain,
prop(sK6) = true,
inference(forward_subsumption_resolution,[status(thm)],[c_3416,c_58]) ).
cnf(c_3420,plain,
~ forallprefers(false1,lazy_impl(true,sK6)),
inference(demodulation,[status(thm)],[c_1993,c_3417]) ).
cnf(c_3422,plain,
lazy_impl(true,lazy_impl(true,sK6)) = false2,
inference(demodulation,[status(thm)],[c_95,c_3417]) ).
cnf(c_3435,plain,
bool(sK6),
inference(superposition,[status(thm)],[c_3417,c_68]) ).
cnf(c_3445,plain,
( true = sK6
| false1 = sK6 ),
inference(superposition,[status(thm)],[c_3435,c_51]) ).
cnf(c_3554,plain,
( lazy_impl(true,lazy_impl(true,false1)) = false2
| true = sK6 ),
inference(superposition,[status(thm)],[c_3445,c_3422]) ).
cnf(c_3571,plain,
( true = sK6
| false1 = false2 ),
inference(light_normalisation,[status(thm)],[c_3554,c_1745]) ).
cnf(c_3572,plain,
true = sK6,
inference(forward_subsumption_resolution,[status(thm)],[c_3571,c_822]) ).
cnf(c_3581,plain,
~ forallprefers(false1,lazy_impl(true,true)),
inference(demodulation,[status(thm)],[c_3420,c_3572]) ).
cnf(c_3586,plain,
~ forallprefers(false1,true),
inference(light_normalisation,[status(thm)],[c_3581,c_1746]) ).
cnf(c_3587,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3586,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW101+1 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jun 19 06:20:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.15 % SZS status Started for theBenchmark.p
% 0.48/1.15 % SZS status Theorem for theBenchmark.p
% 0.48/1.15
% 0.48/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.15
% 0.48/1.15 ------ iProver source info
% 0.48/1.15
% 0.48/1.15 git: date: 2024-06-12 09:56:46 +0000
% 0.48/1.15 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.48/1.15 git: non_committed_changes: false
% 0.48/1.15
% 0.48/1.15 ------ Parsing...
% 0.48/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.15
% 0.48/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.48/1.15
% 0.48/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.15
% 0.48/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.15 ------ Proving...
% 0.48/1.15 ------ Problem Properties
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 clauses 51
% 0.48/1.15 conjectures 1
% 0.48/1.15 EPR 16
% 0.48/1.15 Horn 34
% 0.48/1.15 unary 24
% 0.48/1.15 binary 19
% 0.48/1.15 lits 88
% 0.48/1.15 lits eq 35
% 0.48/1.15 fd_pure 0
% 0.48/1.16 fd_pseudo 0
% 0.48/1.16 fd_cond 1
% 0.48/1.16 fd_pseudo_cond 0
% 0.48/1.16 AC symbols 0
% 0.48/1.16
% 0.48/1.16 ------ Schedule dynamic 5 is on
% 0.48/1.16
% 0.48/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------
% 0.48/1.16 Current options:
% 0.48/1.16 ------
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Proving...
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 % SZS status Theorem for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.16
% 2.48/1.16
%------------------------------------------------------------------------------