TSTP Solution File: LAT382+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LAT382+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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 06:18:24 EDT 2023
% Result : Theorem 1.96s 1.17s
% Output : CNFRefutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 65 ( 25 unt; 0 def)
% Number of atoms : 226 ( 29 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 294 ( 133 ~; 126 |; 25 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 93 ( 0 sgn; 51 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(f8,axiom,
! [X0,X1] :
( ( aElement0(X1)
& aElement0(X0) )
=> ( ( sdtlseqdt0(X1,X0)
& sdtlseqdt0(X0,X1) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mASymm) ).
fof(f12,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
=> ! [X2] :
( aInfimumOfIn0(X2,X1,X0)
<=> ( ! [X3] :
( aLowerBoundOfIn0(X3,X1,X0)
=> sdtlseqdt0(X3,X2) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefInf) ).
fof(f15,axiom,
aSet0(xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__773) ).
fof(f16,axiom,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__773_01) ).
fof(f17,axiom,
( aInfimumOfIn0(xv,xS,xT)
& aInfimumOfIn0(xu,xS,xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__792) ).
fof(f18,conjecture,
xu = xv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f19,negated_conjecture,
xu != xv,
inference(negated_conjecture,[],[f18]) ).
fof(f23,plain,
xu != xv,
inference(flattening,[],[f19]) ).
fof(f24,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f28,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f29,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f28]) ).
fof(f34,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( aInfimumOfIn0(X2,X1,X0)
<=> ( ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aLowerBoundOfIn0(X3,X1,X0) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f57,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X3,X2)
& aLowerBoundOfIn0(X3,X1,X0) )
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aLowerBoundOfIn0(X3,X1,X0) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aInfimumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f34]) ).
fof(f58,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X3,X2)
& aLowerBoundOfIn0(X3,X1,X0) )
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aLowerBoundOfIn0(X3,X1,X0) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aInfimumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(flattening,[],[f57]) ).
fof(f59,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X3,X2)
& aLowerBoundOfIn0(X3,X1,X0) )
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X4] :
( sdtlseqdt0(X4,X2)
| ~ aLowerBoundOfIn0(X4,X1,X0) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aInfimumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(rectify,[],[f58]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ sdtlseqdt0(X3,X2)
& aLowerBoundOfIn0(X3,X1,X0) )
=> ( ~ sdtlseqdt0(sK4(X0,X1,X2),X2)
& aLowerBoundOfIn0(sK4(X0,X1,X2),X1,X0) ) ),
introduced(choice_axiom,[]) ).
fof(f61,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X1,X0)
| ( ~ sdtlseqdt0(sK4(X0,X1,X2),X2)
& aLowerBoundOfIn0(sK4(X0,X1,X2),X1,X0) )
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X4] :
( sdtlseqdt0(X4,X2)
| ~ aLowerBoundOfIn0(X4,X1,X0) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aInfimumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f59,f60]) ).
fof(f67,plain,
! [X0,X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f75,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f85,plain,
! [X2,X0,X1] :
( aElementOf0(X2,X0)
| ~ aInfimumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f86,plain,
! [X2,X0,X1] :
( aLowerBoundOfIn0(X2,X1,X0)
| ~ aInfimumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f87,plain,
! [X2,X0,X1,X4] :
( sdtlseqdt0(X4,X2)
| ~ aLowerBoundOfIn0(X4,X1,X0)
| ~ aInfimumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f96,plain,
aSet0(xT),
inference(cnf_transformation,[],[f15]) ).
fof(f97,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f98,plain,
aInfimumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f17]) ).
fof(f99,plain,
aInfimumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f17]) ).
fof(f100,plain,
xu != xv,
inference(cnf_transformation,[],[f23]) ).
cnf(c_49,plain,
( ~ aElementOf0(X0,X1)
| ~ aSet0(X1)
| aElement0(X0) ),
inference(cnf_transformation,[],[f67]) ).
cnf(c_57,plain,
( ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f75]) ).
cnf(c_69,plain,
( ~ aLowerBoundOfIn0(X0,X1,X2)
| ~ aInfimumOfIn0(X3,X1,X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| sdtlseqdt0(X0,X3) ),
inference(cnf_transformation,[],[f87]) ).
cnf(c_70,plain,
( ~ aInfimumOfIn0(X0,X1,X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| aLowerBoundOfIn0(X0,X1,X2) ),
inference(cnf_transformation,[],[f86]) ).
cnf(c_71,plain,
( ~ aInfimumOfIn0(X0,X1,X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| aElementOf0(X0,X2) ),
inference(cnf_transformation,[],[f85]) ).
cnf(c_78,plain,
aSet0(xT),
inference(cnf_transformation,[],[f96]) ).
cnf(c_79,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f97]) ).
cnf(c_80,plain,
aInfimumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f99]) ).
cnf(c_81,plain,
aInfimumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f98]) ).
cnf(c_82,negated_conjecture,
xv != xu,
inference(cnf_transformation,[],[f100]) ).
cnf(c_708,plain,
( X0 != xv
| X1 != xS
| X2 != xT
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| aElementOf0(X0,X2) ),
inference(resolution_lifted,[status(thm)],[c_71,c_80]) ).
cnf(c_709,plain,
( ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| aElementOf0(xv,xT) ),
inference(unflattening,[status(thm)],[c_708]) ).
cnf(c_710,plain,
aElementOf0(xv,xT),
inference(global_subsumption_just,[status(thm)],[c_709,c_78,c_79,c_709]) ).
cnf(c_715,plain,
( X0 != xv
| X1 != xS
| X2 != xT
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| aLowerBoundOfIn0(X0,X1,X2) ),
inference(resolution_lifted,[status(thm)],[c_70,c_80]) ).
cnf(c_716,plain,
( ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| aLowerBoundOfIn0(xv,xS,xT) ),
inference(unflattening,[status(thm)],[c_715]) ).
cnf(c_717,plain,
aLowerBoundOfIn0(xv,xS,xT),
inference(global_subsumption_just,[status(thm)],[c_716,c_78,c_79,c_716]) ).
cnf(c_722,plain,
( X0 != xu
| X1 != xS
| X2 != xT
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| aElementOf0(X0,X2) ),
inference(resolution_lifted,[status(thm)],[c_71,c_81]) ).
cnf(c_723,plain,
( ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| aElementOf0(xu,xT) ),
inference(unflattening,[status(thm)],[c_722]) ).
cnf(c_724,plain,
aElementOf0(xu,xT),
inference(global_subsumption_just,[status(thm)],[c_723,c_78,c_79,c_723]) ).
cnf(c_729,plain,
( X0 != xu
| X1 != xS
| X2 != xT
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| aLowerBoundOfIn0(X0,X1,X2) ),
inference(resolution_lifted,[status(thm)],[c_70,c_81]) ).
cnf(c_730,plain,
( ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| aLowerBoundOfIn0(xu,xS,xT) ),
inference(unflattening,[status(thm)],[c_729]) ).
cnf(c_731,plain,
aLowerBoundOfIn0(xu,xS,xT),
inference(global_subsumption_just,[status(thm)],[c_730,c_78,c_79,c_730]) ).
cnf(c_736,plain,
( X0 != xS
| X1 != xT
| X2 != xv
| ~ aLowerBoundOfIn0(X3,X0,X1)
| ~ aSubsetOf0(X0,X1)
| ~ aSet0(X1)
| sdtlseqdt0(X3,X2) ),
inference(resolution_lifted,[status(thm)],[c_69,c_80]) ).
cnf(c_737,plain,
( ~ aLowerBoundOfIn0(X0,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| sdtlseqdt0(X0,xv) ),
inference(unflattening,[status(thm)],[c_736]) ).
cnf(c_739,plain,
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xv) ),
inference(global_subsumption_just,[status(thm)],[c_737,c_78,c_79,c_737]) ).
cnf(c_748,plain,
( X0 != xS
| X1 != xT
| X2 != xu
| ~ aLowerBoundOfIn0(X3,X0,X1)
| ~ aSubsetOf0(X0,X1)
| ~ aSet0(X1)
| sdtlseqdt0(X3,X2) ),
inference(resolution_lifted,[status(thm)],[c_69,c_81]) ).
cnf(c_749,plain,
( ~ aLowerBoundOfIn0(X0,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| sdtlseqdt0(X0,xu) ),
inference(unflattening,[status(thm)],[c_748]) ).
cnf(c_751,plain,
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xu) ),
inference(global_subsumption_just,[status(thm)],[c_749,c_78,c_79,c_749]) ).
cnf(c_2610,plain,
( ~ aSet0(xT)
| aElement0(xv) ),
inference(superposition,[status(thm)],[c_710,c_49]) ).
cnf(c_2611,plain,
( ~ aSet0(xT)
| aElement0(xu) ),
inference(superposition,[status(thm)],[c_724,c_49]) ).
cnf(c_2612,plain,
aElement0(xu),
inference(forward_subsumption_resolution,[status(thm)],[c_2611,c_78]) ).
cnf(c_2613,plain,
aElement0(xv),
inference(forward_subsumption_resolution,[status(thm)],[c_2610,c_78]) ).
cnf(c_2664,plain,
sdtlseqdt0(xu,xv),
inference(superposition,[status(thm)],[c_731,c_739]) ).
cnf(c_2666,plain,
( ~ sdtlseqdt0(xv,xu)
| ~ aElement0(xv)
| ~ aElement0(xu)
| xv = xu ),
inference(superposition,[status(thm)],[c_2664,c_57]) ).
cnf(c_2667,plain,
~ sdtlseqdt0(xv,xu),
inference(forward_subsumption_resolution,[status(thm)],[c_2666,c_82,c_2612,c_2613]) ).
cnf(c_2672,plain,
sdtlseqdt0(xv,xu),
inference(superposition,[status(thm)],[c_717,c_751]) ).
cnf(c_2674,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2672,c_2667]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT382+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 Aug 24 04:32:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.46 Running first-order theorem proving
% 0.21/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.96/1.17 % SZS status Started for theBenchmark.p
% 1.96/1.17 % SZS status Theorem for theBenchmark.p
% 1.96/1.17
% 1.96/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.96/1.17
% 1.96/1.17 ------ iProver source info
% 1.96/1.17
% 1.96/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.96/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.96/1.17 git: non_committed_changes: false
% 1.96/1.17 git: last_make_outside_of_git: false
% 1.96/1.17
% 1.96/1.17 ------ Parsing...
% 1.96/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.96/1.17
% 1.96/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e
% 1.96/1.17
% 1.96/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.96/1.17
% 1.96/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.96/1.17 ------ Proving...
% 1.96/1.17 ------ Problem Properties
% 1.96/1.17
% 1.96/1.17
% 1.96/1.17 clauses 34
% 1.96/1.17 conjectures 1
% 1.96/1.17 EPR 23
% 1.96/1.17 Horn 29
% 1.96/1.17 unary 7
% 1.96/1.17 binary 3
% 1.96/1.17 lits 123
% 1.96/1.17 lits eq 3
% 1.96/1.17 fd_pure 0
% 1.96/1.17 fd_pseudo 0
% 1.96/1.17 fd_cond 0
% 1.96/1.17 fd_pseudo_cond 2
% 1.96/1.17 AC symbols 0
% 1.96/1.17
% 1.96/1.17 ------ Schedule dynamic 5 is on
% 1.96/1.17
% 1.96/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.96/1.17
% 1.96/1.17
% 1.96/1.17 ------
% 1.96/1.17 Current options:
% 1.96/1.17 ------
% 1.96/1.17
% 1.96/1.17
% 1.96/1.17
% 1.96/1.17
% 1.96/1.17 ------ Proving...
% 1.96/1.17
% 1.96/1.17
% 1.96/1.17 % SZS status Theorem for theBenchmark.p
% 1.96/1.17
% 1.96/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.96/1.17
% 1.96/1.17
%------------------------------------------------------------------------------