%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN071+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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 09:36:57 AM UTC 2026
% Result : Theorem 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 7 unt; 0 def)
% Number of atoms : 44 ( 43 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 7 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel48,conjecture,
( b = c
| a = d ),
file('theBenchmark.p',pel48) ).
fof(pel48_neg,negated_conjecture,
~ ( b = c
| a = d ),
inference(assume_negation,[status(cth)],[pel48]) ).
fof(pel48_1,axiom,
( c = d
| a = b ),
file('theBenchmark.p',pel48_1) ).
cnf(c_2,plain,
( c = d
| a = b ),
inference(clausify,[status(thm)],[pel48_1]) ).
cnf(c_14,plain,
( c = d
| b = a ),
inference(copy,[status(thm)],[c_2]) ).
cnf(c_3,plain,
( d = c
| b = a ),
inference(copy,[status(thm)],[c_14]) ).
fof(pel48_2,axiom,
( b = d
| a = c ),
file('theBenchmark.p',pel48_2) ).
cnf(c_4,plain,
( b = d
| a = c ),
inference(clausify,[status(thm)],[pel48_2]) ).
cnf(c_15,plain,
( b = d
| c = a ),
inference(copy,[status(thm)],[c_4]) ).
cnf(c_5,plain,
( d = b
| c = a ),
inference(copy,[status(thm)],[c_15]) ).
cnf(c_6,negated_conjecture,
d != a,
inference(clausify,[status(thm)],[pel48_neg]) ).
cnf(c_7,negated_conjecture,
c != b,
inference(clausify,[status(thm)],[pel48_neg]) ).
cnf(c_16,plain,
( b = c
| b = a
| c = a ),
inference(paramod,[status(thm)],[c_5,c_3]) ).
cnf(c_17,plain,
( c = b
| b = a
| c = a ),
inference(copy,[status(thm)],[c_16]) ).
cnf(c_8,negated_conjecture,
( b = a
| c = a ),
inference(resolve,[status(thm)],[c_7,c_17]) ).
cnf(c_10,plain,
( b != a
| c = a ),
inference(paramod,[status(thm)],[c_5,c_6]) ).
cnf(c_18,plain,
( d = a
| b = a
| b = a ),
inference(paramod,[status(thm)],[c_8,c_3]) ).
cnf(c_19,plain,
( d = a
| b = a ),
inference(copy,[status(thm)],[c_18]) ).
cnf(c_11,negated_conjecture,
b = a,
inference(resolve,[status(thm)],[c_6,c_19]) ).
cnf(c_20,plain,
( a != a
| c = a ),
inference(paramod,[status(thm)],[c_11,c_10]) ).
cnf(c_12,plain,
c = a,
inference(copy,[status(thm)],[c_20]) ).
cnf(c_21,negated_conjecture,
a != b,
inference(paramod,[status(thm)],[c_12,c_7]) ).
cnf(c_22,negated_conjecture,
a != a,
inference(paramod,[status(thm)],[c_11,c_21]) ).
cnf(c_13,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN071+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sat Sep 26 17:09:45 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.38 % Process 3780790 was started by sandbox on n010,
% 0.11/0.38 % Sat Sep 26 17:09:45 2026
% 0.11/0.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/0.38
% 0.11/0.38 % From the command line: assign(max_seconds, 300).
% 0.14/0.39
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39
% 0.14/0.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.14/0.39 % Length of proof is 12.
% 0.14/0.39 % Level of proof is 5.
% 0.14/0.39 % Maximum clause weight is 6.000.
% 0.14/0.39 % Given clauses 5.
% 0.14/0.39
% 0.14/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------