TSTP Solution File: SET017+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET017+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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 02:59:20 EDT 2024
% Result : Theorem 0.46s 1.15s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X2,X0,X1] :
( member(X2,unordered_pair(X0,X1))
<=> ( ( X1 = X2
| X0 = X2 )
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_defn) ).
fof(f44,conjecture,
! [X0,X1,X4] :
( ( unordered_pair(X0,X1) = unordered_pair(X0,X4)
& member(X4,universal_class)
& member(X1,universal_class) )
=> X1 = X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_cancellation) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X4] :
( ( unordered_pair(X0,X1) = unordered_pair(X0,X4)
& member(X4,universal_class)
& member(X1,universal_class) )
=> X1 = X4 ),
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(X0,X1) = unordered_pair(X0,X2)
& member(X2,universal_class)
& member(X1,universal_class) )
=> X1 = X2 ),
inference(rectify,[],[f45]) ).
fof(f85,plain,
? [X0,X1,X2] :
( X1 != X2
& unordered_pair(X0,X1) = unordered_pair(X0,X2)
& member(X2,universal_class)
& member(X1,universal_class) ),
inference(ennf_transformation,[],[f70]) ).
fof(f86,plain,
? [X0,X1,X2] :
( X1 != X2
& unordered_pair(X0,X1) = unordered_pair(X0,X2)
& member(X2,universal_class)
& member(X1,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] :
( X1 != X2
& unordered_pair(X0,X1) = unordered_pair(X0,X2)
& member(X2,universal_class)
& member(X1,universal_class) )
=> ( sK7 != sK8
& unordered_pair(sK6,sK7) = unordered_pair(sK6,sK8)
& member(sK8,universal_class)
& member(sK7,universal_class) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
( sK7 != sK8
& unordered_pair(sK6,sK7) = unordered_pair(sK6,sK8)
& member(sK8,universal_class)
& member(sK7,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(f147,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X2
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f94]) ).
fof(f224,plain,
member(sK7,universal_class),
inference(cnf_transformation,[],[f136]) ).
fof(f225,plain,
member(sK8,universal_class),
inference(cnf_transformation,[],[f136]) ).
fof(f226,plain,
unordered_pair(sK6,sK7) = unordered_pair(sK6,sK8),
inference(cnf_transformation,[],[f136]) ).
fof(f227,plain,
sK7 != sK8,
inference(cnf_transformation,[],[f136]) ).
fof(f267,plain,
! [X2,X1] :
( member(X2,unordered_pair(X1,X2))
| ~ member(X2,universal_class) ),
inference(equality_resolution,[],[f147]) ).
cnf(c_56,plain,
( ~ member(X0,universal_class)
| member(X0,unordered_pair(X1,X0)) ),
inference(cnf_transformation,[],[f267]) ).
cnf(c_58,plain,
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[],[f145]) ).
cnf(c_128,negated_conjecture,
sK7 != sK8,
inference(cnf_transformation,[],[f227]) ).
cnf(c_129,negated_conjecture,
unordered_pair(sK6,sK7) = unordered_pair(sK6,sK8),
inference(cnf_transformation,[],[f226]) ).
cnf(c_130,negated_conjecture,
member(sK8,universal_class),
inference(cnf_transformation,[],[f225]) ).
cnf(c_131,negated_conjecture,
member(sK7,universal_class),
inference(cnf_transformation,[],[f224]) ).
cnf(c_1567,plain,
unordered_pair(sK6,sK7) = sP0_iProver_def,
definition ).
cnf(c_1568,plain,
unordered_pair(sK6,sK8) = sP1_iProver_def,
definition ).
cnf(c_1569,negated_conjecture,
member(sK7,universal_class),
inference(demodulation,[status(thm)],[c_131]) ).
cnf(c_1570,negated_conjecture,
member(sK8,universal_class),
inference(demodulation,[status(thm)],[c_130]) ).
cnf(c_1571,negated_conjecture,
sP0_iProver_def = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_129,c_1568,c_1567]) ).
cnf(c_1572,negated_conjecture,
sK7 != sK8,
inference(demodulation,[status(thm)],[c_128]) ).
cnf(c_2395,plain,
unordered_pair(sK6,sK8) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_1568,c_1571]) ).
cnf(c_2495,plain,
( ~ member(sK7,universal_class)
| member(sK7,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_1567,c_56]) ).
cnf(c_2496,plain,
( ~ member(sK8,universal_class)
| member(sK8,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_2395,c_56]) ).
cnf(c_2497,plain,
member(sK8,sP0_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_2496,c_1570]) ).
cnf(c_2498,plain,
member(sK7,sP0_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_2495,c_1569]) ).
cnf(c_3209,plain,
( ~ member(X0,sP0_iProver_def)
| X0 = sK8
| X0 = sK6 ),
inference(superposition,[status(thm)],[c_2395,c_58]) ).
cnf(c_3364,plain,
( sK7 = sK8
| sK7 = sK6 ),
inference(superposition,[status(thm)],[c_2498,c_3209]) ).
cnf(c_3367,plain,
sK7 = sK6,
inference(forward_subsumption_resolution,[status(thm)],[c_3364,c_1572]) ).
cnf(c_3383,plain,
unordered_pair(sK7,sK7) = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_1567,c_3367]) ).
cnf(c_3408,plain,
( ~ member(X0,sP0_iProver_def)
| X0 = sK7 ),
inference(superposition,[status(thm)],[c_3383,c_58]) ).
cnf(c_5331,plain,
sK7 = sK8,
inference(superposition,[status(thm)],[c_2497,c_3408]) ).
cnf(c_5334,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5331,c_1572]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SET017+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.09/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu May 2 20:30:44 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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
% 0.46/1.15 % SZS status Started for theBenchmark.p
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.15
% 0.46/1.15 ------ iProver source info
% 0.46/1.15
% 0.46/1.15 git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.15 git: non_committed_changes: false
% 0.46/1.15
% 0.46/1.15 ------ Parsing...
% 0.46/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.15
% 0.46/1.15 ------ 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.46/1.15
% 0.46/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.46/1.15 ------ Proving...
% 0.46/1.15 ------ Problem Properties
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 clauses 80
% 0.46/1.15 conjectures 4
% 0.46/1.15 EPR 11
% 0.46/1.15 Horn 72
% 0.46/1.15 unary 20
% 0.46/1.15 binary 39
% 0.46/1.15 lits 162
% 0.46/1.15 lits eq 18
% 0.46/1.15 fd_pure 0
% 0.46/1.15 fd_pseudo 0
% 0.46/1.15 fd_cond 4
% 0.46/1.15 fd_pseudo_cond 3
% 0.46/1.15 AC symbols 0
% 0.46/1.15
% 0.46/1.15 ------ Schedule dynamic 5 is on
% 0.46/1.15
% 0.46/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------
% 0.46/1.15 Current options:
% 0.46/1.15 ------
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------ Proving...
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.15
% 0.46/1.15
%------------------------------------------------------------------------------