TSTP Solution File: SEU151+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU151+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:04:43 EDT 2024
% Result : Theorem 1.88s 1.17s
% Output : CNFRefutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 46 ( 25 unt; 0 def)
% Number of atoms : 141 ( 105 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 161 ( 66 ~; 55 |; 36 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 82 ( 2 sgn 60 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f3,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f5,conjecture,
! [X0,X1,X2,X3] :
~ ( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2,X3] :
~ ( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
inference(negated_conjecture,[],[f5]) ).
fof(f8,plain,
? [X0,X1,X2,X3] :
( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f10,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f10]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) )
=> ( ( ( sK0(X0,X1,X2) != X1
& sK0(X0,X1,X2) != X0 )
| ~ in(sK0(X0,X1,X2),X2) )
& ( sK0(X0,X1,X2) = X1
| sK0(X0,X1,X2) = X0
| in(sK0(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ( ( ( sK0(X0,X1,X2) != X1
& sK0(X0,X1,X2) != X0 )
| ~ in(sK0(X0,X1,X2),X2) )
& ( sK0(X0,X1,X2) = X1
| sK0(X0,X1,X2) = X0
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f11,f12]) ).
fof(f14,plain,
( ? [X0,X1,X2,X3] :
( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) )
=> ( sK1 != sK4
& sK1 != sK3
& unordered_pair(sK1,sK2) = unordered_pair(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( sK1 != sK4
& sK1 != sK3
& unordered_pair(sK1,sK2) = unordered_pair(sK3,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f8,f14]) ).
fof(f17,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f18,plain,
! [X2,X0,X1,X4] :
( X1 = X4
| X0 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
unordered_pair(sK1,sK2) = unordered_pair(sK3,sK4),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
sK1 != sK3,
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
sK1 != sK4,
inference(cnf_transformation,[],[f15]) ).
fof(f27,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f20]) ).
fof(f28,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f27]) ).
fof(f29,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f19]) ).
fof(f30,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f29]) ).
fof(f31,plain,
! [X0,X1,X4] :
( X1 = X4
| X0 = X4
| ~ in(X4,unordered_pair(X0,X1)) ),
inference(equality_resolution,[],[f18]) ).
cnf(c_50,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f17]) ).
cnf(c_54,plain,
in(X0,unordered_pair(X1,X0)),
inference(cnf_transformation,[],[f28]) ).
cnf(c_55,plain,
in(X0,unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f30]) ).
cnf(c_56,plain,
( ~ in(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_57,negated_conjecture,
sK1 != sK4,
inference(cnf_transformation,[],[f26]) ).
cnf(c_58,negated_conjecture,
sK1 != sK3,
inference(cnf_transformation,[],[f25]) ).
cnf(c_59,negated_conjecture,
unordered_pair(sK1,sK2) = unordered_pair(sK3,sK4),
inference(cnf_transformation,[],[f24]) ).
cnf(c_108,plain,
unordered_pair(sK1,sK2) = unordered_pair(sK4,sK3),
inference(demodulation,[status(thm)],[c_59,c_50]) ).
cnf(c_142,negated_conjecture,
sK1 != sK3,
inference(demodulation,[status(thm)],[c_58]) ).
cnf(c_143,negated_conjecture,
sK1 != sK4,
inference(demodulation,[status(thm)],[c_57]) ).
cnf(c_281,plain,
in(sK3,unordered_pair(sK1,sK2)),
inference(superposition,[status(thm)],[c_108,c_54]) ).
cnf(c_282,plain,
in(sK4,unordered_pair(sK1,sK2)),
inference(superposition,[status(thm)],[c_108,c_55]) ).
cnf(c_302,plain,
( sK1 = sK3
| sK3 = sK2 ),
inference(superposition,[status(thm)],[c_281,c_56]) ).
cnf(c_303,plain,
( sK1 = sK4
| sK4 = sK2 ),
inference(superposition,[status(thm)],[c_282,c_56]) ).
cnf(c_307,plain,
sK4 = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_303,c_143]) ).
cnf(c_308,plain,
sK3 = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_302,c_142]) ).
cnf(c_314,plain,
unordered_pair(sK1,sK4) = unordered_pair(sK4,sK3),
inference(demodulation,[status(thm)],[c_108,c_307]) ).
cnf(c_348,plain,
sK4 = sK3,
inference(light_normalisation,[status(thm)],[c_308,c_307]) ).
cnf(c_353,plain,
unordered_pair(sK1,sK4) = unordered_pair(sK4,sK4),
inference(light_normalisation,[status(thm)],[c_314,c_348]) ).
cnf(c_357,plain,
( ~ in(X0,unordered_pair(sK1,sK4))
| X0 = sK4 ),
inference(superposition,[status(thm)],[c_353,c_56]) ).
cnf(c_372,plain,
sK1 = sK4,
inference(superposition,[status(thm)],[c_55,c_357]) ).
cnf(c_373,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_372,c_143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU151+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 17:18:19 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.88/1.17 % SZS status Started for theBenchmark.p
% 1.88/1.17 % SZS status Theorem for theBenchmark.p
% 1.88/1.17
% 1.88/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.88/1.17
% 1.88/1.17 ------ iProver source info
% 1.88/1.17
% 1.88/1.17 git: date: 2024-05-02 19:28:25 +0000
% 1.88/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.88/1.17 git: non_committed_changes: false
% 1.88/1.17
% 1.88/1.17 ------ Parsing...
% 1.88/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.88/1.17
% 1.88/1.17 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.88/1.17
% 1.88/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.88/1.17
% 1.88/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.88/1.17 ------ Proving...
% 1.88/1.17 ------ Problem Properties
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17 clauses 11
% 1.88/1.17 conjectures 2
% 1.88/1.17 EPR 3
% 1.88/1.17 Horn 9
% 1.88/1.17 unary 6
% 1.88/1.17 binary 1
% 1.88/1.17 lits 21
% 1.88/1.17 lits eq 13
% 1.88/1.17 fd_pure 0
% 1.88/1.17 fd_pseudo 0
% 1.88/1.17 fd_cond 0
% 1.88/1.17 fd_pseudo_cond 3
% 1.88/1.17 AC symbols 0
% 1.88/1.17
% 1.88/1.17 ------ Schedule dynamic 5 is on
% 1.88/1.17
% 1.88/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17 ------
% 1.88/1.17 Current options:
% 1.88/1.17 ------
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17 ------ Proving...
% 1.88/1.17
% 1.88/1.17
% 1.88/1.17 % SZS status Theorem for theBenchmark.p
% 1.88/1.17
% 1.88/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.88/1.17
% 1.88/1.17
%------------------------------------------------------------------------------