TSTP Solution File: SET021-7 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET021-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:05:38 EDT 2023
% Result : Unsatisfiable 3.54s 1.15s
% Output : CNFRefutation 3.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 5 unt; 0 nHn; 13 RR)
% Number of literals : 24 ( 12 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_109,plain,
( ordered_pair(X0,X1) != ordered_pair(X2,X3)
| ~ member(X1,universal_class)
| X1 = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_determines_components2) ).
cnf(c_115,negated_conjecture,
member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_sets2_1) ).
cnf(c_116,negated_conjecture,
second(ordered_pair(u,v)) != v,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_sets2_2) ).
cnf(c_131,plain,
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product2) ).
cnf(c_133,plain,
( ~ member(X0,cross_product(X1,X2))
| ordered_pair(first(X0),second(X0)) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product4) ).
cnf(c_7070,plain,
ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))) = ordered_pair(u,v),
inference(superposition,[status(thm)],[c_115,c_133]) ).
cnf(c_7446,plain,
( ordered_pair(X0,X1) != ordered_pair(u,v)
| ~ member(second(ordered_pair(u,v)),universal_class)
| second(ordered_pair(u,v)) = X1 ),
inference(superposition,[status(thm)],[c_7070,c_109]) ).
cnf(c_7450,plain,
( ~ member(ordered_pair(u,v),cross_product(X0,X1))
| member(second(ordered_pair(u,v)),X1) ),
inference(superposition,[status(thm)],[c_7070,c_131]) ).
cnf(c_7454,plain,
( ordered_pair(X0,X1) != ordered_pair(u,v)
| ~ member(X1,universal_class)
| second(ordered_pair(u,v)) = X1 ),
inference(superposition,[status(thm)],[c_7070,c_109]) ).
cnf(c_7459,plain,
( ~ member(ordered_pair(u,v),cross_product(universal_class,universal_class))
| member(second(ordered_pair(u,v)),universal_class) ),
inference(instantiation,[status(thm)],[c_7450]) ).
cnf(c_9379,plain,
( ordered_pair(X0,X1) != ordered_pair(u,v)
| second(ordered_pair(u,v)) = X1 ),
inference(global_subsumption_just,[status(thm)],[c_7454,c_115,c_7459,c_7446]) ).
cnf(c_9395,plain,
second(ordered_pair(u,v)) = v,
inference(equality_resolution,[status(thm)],[c_9379]) ).
cnf(c_9396,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_116,c_9395]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET021-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n013.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sat Aug 26 15:59:33 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.54/1.15 % SZS status Started for theBenchmark.p
% 3.54/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.54/1.15
% 3.54/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.54/1.15
% 3.54/1.15 ------ iProver source info
% 3.54/1.15
% 3.54/1.15 git: date: 2023-05-31 18:12:56 +0000
% 3.54/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.54/1.15 git: non_committed_changes: false
% 3.54/1.15 git: last_make_outside_of_git: false
% 3.54/1.15
% 3.54/1.15 ------ Parsing...successful
% 3.54/1.15
% 3.54/1.15
% 3.54/1.15
% 3.54/1.15 ------ Preprocessing... sup_sim: 2 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 3.54/1.15
% 3.54/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.54/1.15
% 3.54/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.54/1.15 ------ Proving...
% 3.54/1.15 ------ Problem Properties
% 3.54/1.15
% 3.54/1.15
% 3.54/1.15 clauses 149
% 3.54/1.15 conjectures 2
% 3.54/1.15 EPR 17
% 3.54/1.15 Horn 118
% 3.54/1.15 unary 47
% 3.54/1.15 binary 62
% 3.54/1.15 lits 298
% 3.54/1.15 lits eq 97
% 3.54/1.15 fd_pure 0
% 3.54/1.15 fd_pseudo 0
% 3.54/1.15 fd_cond 5
% 3.54/1.15 fd_pseudo_cond 16
% 3.54/1.15 AC symbols 0
% 3.54/1.15
% 3.54/1.15 ------ Input Options Time Limit: Unbounded
% 3.54/1.15
% 3.54/1.15
% 3.54/1.15 ------
% 3.54/1.15 Current options:
% 3.54/1.15 ------
% 3.54/1.15
% 3.54/1.15
% 3.54/1.15
% 3.54/1.15
% 3.54/1.15 ------ Proving...
% 3.54/1.15
% 3.54/1.15
% 3.54/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.54/1.15
% 3.54/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.54/1.15
% 3.54/1.15
%------------------------------------------------------------------------------