TSTP Solution File: SET115-7 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET115-7 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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 : 600s
% DateTime : Tue Jul 19 05:24:13 EDT 2022
% Result : Unsatisfiable 0.17s 0.43s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 1 nHn; 5 RR)
% Number of literals : 6 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(65,axiom,
( equal(first(u),u)
| equal(ordered_pair(first(u),second(u)),u) ),
file('SET115-7.p',unknown),
[] ).
cnf(69,axiom,
~ equal(ordered_pair(first(x__dfg),second(x__dfg)),x__dfg),
file('SET115-7.p',unknown),
[] ).
cnf(70,axiom,
~ equal(first(x__dfg),x__dfg),
file('SET115-7.p',unknown),
[] ).
cnf(201,plain,
equal(first(x__dfg),x__dfg),
inference(res,[status(thm),theory(equality)],[65,69]),
[iquote('0:Res:65.0,69.0')] ).
cnf(231,plain,
$false,
inference(mrr,[status(thm)],[201,70]),
[iquote('0:MRR:201.0,70.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET115-7 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jul 10 07:47:57 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.43
% 0.17/0.43 SPASS V 3.9
% 0.17/0.43 SPASS beiseite: Proof found.
% 0.17/0.43 % SZS status Theorem
% 0.17/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43 SPASS derived 15 clauses, backtracked 0 clauses, performed 0 splits and kept 154 clauses.
% 0.17/0.43 SPASS allocated 75822 KBytes.
% 0.17/0.43 SPASS spent 0:00:00.09 on the problem.
% 0.17/0.43 0:00:00.04 for the input.
% 0.17/0.43 0:00:00.00 for the FLOTTER CNF translation.
% 0.17/0.43 0:00:00.00 for inferences.
% 0.17/0.43 0:00:00.00 for the backtracking.
% 0.17/0.43 0:00:00.01 for the reduction.
% 0.17/0.43
% 0.17/0.43
% 0.17/0.43 Here is a proof with depth 1, length 5 :
% 0.17/0.43 % SZS output start Refutation
% See solution above
% 0.17/0.43 Formulae used in the proof : existence_of_1st_and_2nd_4 prove_unique_1st_and_2nd_in_pair_of_non_sets3_1 prove_unique_1st_in_pair_of_non_sets
% 0.17/0.43
%------------------------------------------------------------------------------