TSTP Solution File: SET886+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET886+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:10:30 EDT 2023
% Result : Theorem 1.61s 1.15s
% Output : CNFRefutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 17 unt; 0 def)
% Number of atoms : 41 ( 24 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 28 ( 15 ~; 5 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 2 sgn; 24 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f5,axiom,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),singleton(X2))
=> X0 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_zfmisc_1) ).
fof(f6,conjecture,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),singleton(X2))
=> unordered_pair(X0,X1) = singleton(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t27_zfmisc_1) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),singleton(X2))
=> unordered_pair(X0,X1) = singleton(X2) ),
inference(negated_conjecture,[],[f6]) ).
fof(f8,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f10,plain,
! [X0,X1,X2] :
( X0 = X2
| ~ subset(unordered_pair(X0,X1),singleton(X2)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f11,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X1) != singleton(X2)
& subset(unordered_pair(X0,X1),singleton(X2)) ),
inference(ennf_transformation,[],[f7]) ).
fof(f16,plain,
( ? [X0,X1,X2] :
( unordered_pair(X0,X1) != singleton(X2)
& subset(unordered_pair(X0,X1),singleton(X2)) )
=> ( unordered_pair(sK2,sK3) != singleton(sK4)
& subset(unordered_pair(sK2,sK3),singleton(sK4)) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( unordered_pair(sK2,sK3) != singleton(sK4)
& subset(unordered_pair(sK2,sK3),singleton(sK4)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f11,f16]) ).
fof(f18,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f22,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ subset(unordered_pair(X0,X1),singleton(X2)) ),
inference(cnf_transformation,[],[f10]) ).
fof(f23,plain,
subset(unordered_pair(sK2,sK3),singleton(sK4)),
inference(cnf_transformation,[],[f17]) ).
fof(f24,plain,
unordered_pair(sK2,sK3) != singleton(sK4),
inference(cnf_transformation,[],[f17]) ).
fof(f25,plain,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
inference(cnf_transformation,[],[f8]) ).
fof(f26,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ subset(unordered_pair(X0,X1),unordered_pair(X2,X2)) ),
inference(definition_unfolding,[],[f22,f25]) ).
fof(f27,plain,
unordered_pair(sK2,sK3) != unordered_pair(sK4,sK4),
inference(definition_unfolding,[],[f24,f25]) ).
fof(f28,plain,
subset(unordered_pair(sK2,sK3),unordered_pair(sK4,sK4)),
inference(definition_unfolding,[],[f23,f25]) ).
cnf(c_49,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f18]) ).
cnf(c_53,plain,
( ~ subset(unordered_pair(X0,X1),unordered_pair(X2,X2))
| X0 = X2 ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_54,negated_conjecture,
unordered_pair(sK2,sK3) != unordered_pair(sK4,sK4),
inference(cnf_transformation,[],[f27]) ).
cnf(c_55,negated_conjecture,
subset(unordered_pair(sK2,sK3),unordered_pair(sK4,sK4)),
inference(cnf_transformation,[],[f28]) ).
cnf(c_240,plain,
sK2 = sK4,
inference(superposition,[status(thm)],[c_55,c_53]) ).
cnf(c_241,plain,
( ~ subset(unordered_pair(X0,X1),unordered_pair(X2,X2))
| X1 = X2 ),
inference(superposition,[status(thm)],[c_49,c_53]) ).
cnf(c_245,plain,
unordered_pair(sK4,sK3) != unordered_pair(sK4,sK4),
inference(demodulation,[status(thm)],[c_54,c_240]) ).
cnf(c_246,plain,
subset(unordered_pair(sK4,sK3),unordered_pair(sK4,sK4)),
inference(demodulation,[status(thm)],[c_55,c_240]) ).
cnf(c_253,plain,
sK3 = sK4,
inference(superposition,[status(thm)],[c_246,c_241]) ).
cnf(c_256,plain,
unordered_pair(sK4,sK4) != unordered_pair(sK4,sK4),
inference(demodulation,[status(thm)],[c_245,c_253]) ).
cnf(c_258,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET886+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat Aug 26 16:12:30 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.61/1.15 % SZS status Started for theBenchmark.p
% 1.61/1.15 % SZS status Theorem for theBenchmark.p
% 1.61/1.15
% 1.61/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.61/1.15
% 1.61/1.15 ------ iProver source info
% 1.61/1.15
% 1.61/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.61/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.61/1.15 git: non_committed_changes: false
% 1.61/1.15 git: last_make_outside_of_git: false
% 1.61/1.15
% 1.61/1.15 ------ Parsing...
% 1.61/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.61/1.15
% 1.61/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 1.61/1.15
% 1.61/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.61/1.15
% 1.61/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.61/1.15 ------ Proving...
% 1.61/1.15 ------ Problem Properties
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15 clauses 6
% 1.61/1.15 conjectures 2
% 1.61/1.15 EPR 2
% 1.61/1.15 Horn 6
% 1.61/1.15 unary 5
% 1.61/1.15 binary 1
% 1.61/1.15 lits 7
% 1.61/1.15 lits eq 4
% 1.61/1.15 fd_pure 0
% 1.61/1.15 fd_pseudo 0
% 1.61/1.15 fd_cond 0
% 1.61/1.15 fd_pseudo_cond 1
% 1.61/1.15 AC symbols 0
% 1.61/1.15
% 1.61/1.15 ------ Schedule dynamic 5 is on
% 1.61/1.15
% 1.61/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15 ------
% 1.61/1.15 Current options:
% 1.61/1.15 ------
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15 ------ Proving...
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15 % SZS status Theorem for theBenchmark.p
% 1.61/1.15
% 1.61/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.61/1.15
% 1.61/1.15
%------------------------------------------------------------------------------