TSTP Solution File: SET072+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET072+1 : TPTP v8.1.2. Bugfixed v5.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 15:06:11 EDT 2023
% Result : Theorem 0.48s 1.17s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 12 unt; 0 def)
% Number of atoms : 89 ( 43 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 83 ( 26 ~; 22 |; 29 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 1 sgn; 29 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X2,X0,X1] :
( member(X2,unordered_pair(X0,X1))
<=> ( ( X1 = X2
| X0 = X2 )
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_defn) ).
fof(f44,conjecture,
! [X0,X1,X4] :
( ( unordered_pair(X0,X4) = unordered_pair(X1,X4)
& member(X1,universal_class)
& member(X0,universal_class) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_cancellation) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X4] :
( ( unordered_pair(X0,X4) = unordered_pair(X1,X4)
& member(X1,universal_class)
& member(X0,universal_class) )
=> X0 = X1 ),
inference(negated_conjecture,[],[f44]) ).
fof(f46,plain,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) ),
inference(rectify,[],[f4]) ).
fof(f70,plain,
~ ! [X0,X1,X2] :
( ( unordered_pair(X1,X2) = unordered_pair(X0,X2)
& member(X1,universal_class)
& member(X0,universal_class) )
=> X0 = X1 ),
inference(rectify,[],[f45]) ).
fof(f85,plain,
? [X0,X1,X2] :
( X0 != X1
& unordered_pair(X1,X2) = unordered_pair(X0,X2)
& member(X1,universal_class)
& member(X0,universal_class) ),
inference(ennf_transformation,[],[f70]) ).
fof(f86,plain,
? [X0,X1,X2] :
( X0 != X1
& unordered_pair(X1,X2) = unordered_pair(X0,X2)
& member(X1,universal_class)
& member(X0,universal_class) ),
inference(flattening,[],[f85]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class) )
& ( ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f46]) ).
fof(f94,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class) )
& ( ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f93]) ).
fof(f135,plain,
( ? [X0,X1,X2] :
( X0 != X1
& unordered_pair(X1,X2) = unordered_pair(X0,X2)
& member(X1,universal_class)
& member(X0,universal_class) )
=> ( sK6 != sK7
& unordered_pair(sK7,sK8) = unordered_pair(sK6,sK8)
& member(sK7,universal_class)
& member(sK6,universal_class) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
( sK6 != sK7
& unordered_pair(sK7,sK8) = unordered_pair(sK6,sK8)
& member(sK7,universal_class)
& member(sK6,universal_class) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f86,f135]) ).
fof(f145,plain,
! [X2,X0,X1] :
( X0 = X2
| X0 = X1
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f94]) ).
fof(f146,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X1
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f94]) ).
fof(f224,plain,
member(sK6,universal_class),
inference(cnf_transformation,[],[f136]) ).
fof(f225,plain,
member(sK7,universal_class),
inference(cnf_transformation,[],[f136]) ).
fof(f226,plain,
unordered_pair(sK7,sK8) = unordered_pair(sK6,sK8),
inference(cnf_transformation,[],[f136]) ).
fof(f227,plain,
sK6 != sK7,
inference(cnf_transformation,[],[f136]) ).
fof(f268,plain,
! [X2,X1] :
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(equality_resolution,[],[f146]) ).
cnf(c_57,plain,
( ~ member(X0,universal_class)
| member(X0,unordered_pair(X0,X1)) ),
inference(cnf_transformation,[],[f268]) ).
cnf(c_58,plain,
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[],[f145]) ).
cnf(c_128,negated_conjecture,
sK6 != sK7,
inference(cnf_transformation,[],[f227]) ).
cnf(c_129,negated_conjecture,
unordered_pair(sK6,sK8) = unordered_pair(sK7,sK8),
inference(cnf_transformation,[],[f226]) ).
cnf(c_130,negated_conjecture,
member(sK7,universal_class),
inference(cnf_transformation,[],[f225]) ).
cnf(c_131,negated_conjecture,
member(sK6,universal_class),
inference(cnf_transformation,[],[f224]) ).
cnf(c_2489,plain,
( ~ member(sK7,universal_class)
| member(sK7,unordered_pair(sK6,sK8)) ),
inference(superposition,[status(thm)],[c_129,c_57]) ).
cnf(c_2490,plain,
member(sK7,unordered_pair(sK6,sK8)),
inference(forward_subsumption_resolution,[status(thm)],[c_2489,c_130]) ).
cnf(c_3155,plain,
( sK6 = sK7
| sK7 = sK8 ),
inference(superposition,[status(thm)],[c_2490,c_58]) ).
cnf(c_3158,plain,
sK7 = sK8,
inference(forward_subsumption_resolution,[status(thm)],[c_3155,c_128]) ).
cnf(c_3177,plain,
unordered_pair(sK6,sK7) = unordered_pair(sK7,sK7),
inference(demodulation,[status(thm)],[c_129,c_3158]) ).
cnf(c_3223,plain,
( ~ member(X0,unordered_pair(sK6,sK7))
| X0 = sK7 ),
inference(superposition,[status(thm)],[c_3177,c_58]) ).
cnf(c_3284,plain,
( ~ member(sK6,universal_class)
| sK6 = sK7 ),
inference(superposition,[status(thm)],[c_57,c_3223]) ).
cnf(c_3289,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3284,c_128,c_131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET072+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n031.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 : Sat Aug 26 10:28:08 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.17 % SZS status Started for theBenchmark.p
% 0.48/1.17 % SZS status Theorem for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.17
% 0.48/1.17 ------ iProver source info
% 0.48/1.17
% 0.48/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.17 git: non_committed_changes: false
% 0.48/1.17 git: last_make_outside_of_git: false
% 0.48/1.17
% 0.48/1.17 ------ Parsing...
% 0.48/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.17 ------ Proving...
% 0.48/1.17 ------ Problem Properties
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 clauses 78
% 0.48/1.17 conjectures 4
% 0.48/1.17 EPR 10
% 0.48/1.17 Horn 70
% 0.48/1.17 unary 18
% 0.48/1.17 binary 39
% 0.48/1.17 lits 160
% 0.48/1.17 lits eq 16
% 0.48/1.17 fd_pure 0
% 0.48/1.17 fd_pseudo 0
% 0.48/1.17 fd_cond 4
% 0.48/1.17 fd_pseudo_cond 3
% 0.48/1.17 AC symbols 0
% 0.48/1.17
% 0.48/1.17 ------ Schedule dynamic 5 is on
% 0.48/1.17
% 0.48/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------
% 0.48/1.17 Current options:
% 0.48/1.17 ------
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------ Proving...
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 % SZS status Theorem for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.17
% 0.48/1.17
%------------------------------------------------------------------------------