%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET025-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:35:23 AM UTC 2026
% Result : Unsatisfiable 0.24s 0.51s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 8 ( 2 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_ordered_pairs_are_small,axiom,
~ little_set(ordered_pair(a,b)),
file('theBenchmark.p',prove_ordered_pairs_are_small) ).
cnf(c_64,plain,
~ little_set(ordered_pair(a,b)),
inference(clausify,[status(thm)],[prove_ordered_pairs_are_small]) ).
fof(ordered_pair,axiom,
! [VAR_0,VAR_1] : ordered_pair(VAR_0,VAR_1) = non_ordered_pair(singleton_set(VAR_0),non_ordered_pair(VAR_0,VAR_1)),
file('theBenchmark.p',ordered_pair) ).
cnf(c_183,plain,
ordered_pair(A,B) = non_ordered_pair(singleton_set(A),non_ordered_pair(A,B)),
inference(clausify,[status(thm)],[ordered_pair]) ).
fof(non_ordered_pair4,axiom,
! [VAR_0,VAR_1] : little_set(non_ordered_pair(VAR_0,VAR_1)),
file('theBenchmark.p',non_ordered_pair4) ).
cnf(c_185,plain,
little_set(non_ordered_pair(A,B)),
inference(clausify,[status(thm)],[non_ordered_pair4]) ).
cnf(c_473,plain,
~ little_set(non_ordered_pair(singleton_set(a),non_ordered_pair(a,b))),
inference(paramod,[status(thm)],[c_183,c_64]) ).
cnf(c_472,plain,
$false,
inference(resolve,[status(thm)],[c_185,c_473]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET025-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n005.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Sat Sep 26 06:54:18 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.44 % Process 1481824 was started by sandbox on n005,
% 0.17/0.44 % Sat Sep 26 06:54:18 2026
% 0.17/0.44 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.17/0.45
% 0.17/0.45 % From the command line: assign(max_seconds, 300).
% 0.24/0.51
% 0.24/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.24/0.51
% 0.24/0.51 % Proof 1 at 0.03 (+ 0.01) seconds.
% 0.24/0.51 % Length of proof is 4.
% 0.24/0.51 % Level of proof is 1.
% 0.24/0.51 % Maximum clause weight is 25.000.
% 0.24/0.51 % Given clauses 108.
% 0.24/0.51
% 0.24/0.51 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------