TSTP Solution File: SET020-7 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET020-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:23 EDT 2024
% Result : Unsatisfiable 4.39s 1.23s
% Output : CNFRefutation 4.39s
% 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_108,plain,
( ordered_pair(X0,X1) != ordered_pair(X2,X3)
| ~ member(X0,universal_class)
| X0 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_determines_components1) ).
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_sets1_1) ).
cnf(c_116,negated_conjecture,
first(ordered_pair(u,v)) != u,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_sets1_2) ).
cnf(c_130,plain,
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product1) ).
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_7448,plain,
( ordered_pair(X0,X1) != ordered_pair(u,v)
| ~ member(first(ordered_pair(u,v)),universal_class)
| first(ordered_pair(u,v)) = X0 ),
inference(superposition,[status(thm)],[c_7070,c_108]) ).
cnf(c_7452,plain,
( ~ member(ordered_pair(u,v),cross_product(X0,X1))
| member(first(ordered_pair(u,v)),X0) ),
inference(superposition,[status(thm)],[c_7070,c_130]) ).
cnf(c_7456,plain,
( ordered_pair(X0,X1) != ordered_pair(u,v)
| ~ member(X0,universal_class)
| first(ordered_pair(u,v)) = X0 ),
inference(superposition,[status(thm)],[c_7070,c_108]) ).
cnf(c_7463,plain,
( ~ member(ordered_pair(u,v),cross_product(universal_class,universal_class))
| member(first(ordered_pair(u,v)),universal_class) ),
inference(instantiation,[status(thm)],[c_7452]) ).
cnf(c_9417,plain,
( ordered_pair(X0,X1) != ordered_pair(u,v)
| first(ordered_pair(u,v)) = X0 ),
inference(global_subsumption_just,[status(thm)],[c_7456,c_115,c_7463,c_7448]) ).
cnf(c_9432,plain,
first(ordered_pair(u,v)) = u,
inference(equality_resolution,[status(thm)],[c_9417]) ).
cnf(c_9433,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_116,c_9432]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET020-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n025.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 20:34:43 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.39/1.23 % SZS status Started for theBenchmark.p
% 4.39/1.23 % SZS status Unsatisfiable for theBenchmark.p
% 4.39/1.23
% 4.39/1.23 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.39/1.23
% 4.39/1.23 ------ iProver source info
% 4.39/1.23
% 4.39/1.23 git: date: 2024-05-02 19:28:25 +0000
% 4.39/1.23 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.39/1.23 git: non_committed_changes: false
% 4.39/1.23
% 4.39/1.23 ------ Parsing...successful
% 4.39/1.23
% 4.39/1.23
% 4.39/1.23
% 4.39/1.23 ------ 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
% 4.39/1.23
% 4.39/1.23 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.39/1.23
% 4.39/1.23 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.39/1.23 ------ Proving...
% 4.39/1.23 ------ Problem Properties
% 4.39/1.23
% 4.39/1.23
% 4.39/1.23 clauses 149
% 4.39/1.23 conjectures 2
% 4.39/1.23 EPR 17
% 4.39/1.23 Horn 118
% 4.39/1.23 unary 47
% 4.39/1.23 binary 62
% 4.39/1.23 lits 298
% 4.39/1.23 lits eq 97
% 4.39/1.23 fd_pure 0
% 4.39/1.23 fd_pseudo 0
% 4.39/1.23 fd_cond 5
% 4.39/1.23 fd_pseudo_cond 16
% 4.39/1.23 AC symbols 0
% 4.39/1.23
% 4.39/1.23 ------ Input Options Time Limit: Unbounded
% 4.39/1.23
% 4.39/1.23
% 4.39/1.23 ------
% 4.39/1.23 Current options:
% 4.39/1.23 ------
% 4.39/1.23
% 4.39/1.23
% 4.39/1.23
% 4.39/1.23
% 4.39/1.23 ------ Proving...
% 4.39/1.23
% 4.39/1.23
% 4.39/1.23 % SZS status Unsatisfiable for theBenchmark.p
% 4.39/1.23
% 4.39/1.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.39/1.23
% 4.39/1.23
%------------------------------------------------------------------------------