%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET025-8 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n004.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 : Tue May 5 05:06:56 PM UTC 2026
% Result : Unsatisfiable 1.40s 1.75s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 8 RR)
% Number of literals : 13 ( 2 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 7 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ordered_pairs_are_small1,axiom,
little_set(ordered_pair(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pairs_are_small1) ).
cnf(ordered_pair_predicate3,axiom,
( X1 = ordered_pair(f2(X1),f3(X1))
| ~ ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate3) ).
cnf(an_ordered_pair_predicate,hypothesis,
ordered_pair_predicate(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_ordered_pair_predicate) ).
cnf(prove_predicate_is_small,negated_conjecture,
~ little_set(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_predicate_is_small) ).
cnf(c_0_4,axiom,
little_set(ordered_pair(X1,X2)),
ordered_pairs_are_small1 ).
cnf(c_0_5,axiom,
( X1 = ordered_pair(f2(X1),f3(X1))
| ~ ordered_pair_predicate(X1) ),
ordered_pair_predicate3 ).
cnf(c_0_6,plain,
( little_set(X1)
| ~ ordered_pair_predicate(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,hypothesis,
ordered_pair_predicate(a),
an_ordered_pair_predicate ).
cnf(c_0_8,negated_conjecture,
~ little_set(a),
prove_predicate_is_small ).
cnf(c_0_9,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET025-8 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32 % Computer : n004.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Tue May 5 02:04:48 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 1.40/1.75 % Version : CSE_E---1.7
% 1.40/1.75 % Problem : theBenchmark.p
% 1.40/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 1.40/1.75 % SZS output start CNFRefutation
% See solution above
% 1.40/1.75 % Total time : 1.373s
%------------------------------------------------------------------------------