%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN349-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n007.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:37:39 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.37s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 75 ( 30 ~; 45 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 38 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause1,axiom,
! [VAR_0,VAR_1] :
( ~ f(w(VAR_0),g(VAR_0,VAR_1))
| f(VAR_0,g(VAR_0,VAR_1)) ),
file('theBenchmark.p',clause1) ).
cnf(c_1,plain,
( ~ f(w(A),g(A,B))
| f(A,g(A,B)) ),
inference(clausify,[status(thm)],[clause1]) ).
fof(clause2,axiom,
! [VAR_0,VAR_1] :
( f(w(VAR_0),g(VAR_0,VAR_1))
| ~ f(VAR_0,g(VAR_0,VAR_1)) ),
file('theBenchmark.p',clause2) ).
cnf(c_2,plain,
( f(w(A),g(A,B))
| ~ f(A,g(A,B)) ),
inference(clausify,[status(thm)],[clause2]) ).
fof(clause3,axiom,
! [VAR_0,VAR_1] :
( f(g(VAR_0,VAR_1),w(VAR_0))
| ~ f(VAR_1,g(VAR_0,VAR_1))
| f(g(VAR_0,VAR_1),VAR_1)
| ~ f(VAR_0,g(VAR_0,VAR_1)) ),
file('theBenchmark.p',clause3) ).
cnf(c_3,plain,
( f(g(A,B),w(A))
| ~ f(B,g(A,B))
| f(g(A,B),B)
| ~ f(A,g(A,B)) ),
inference(clausify,[status(thm)],[clause3]) ).
fof(clause5,axiom,
! [VAR_0,VAR_1] :
( f(g(VAR_0,VAR_1),w(VAR_0))
| f(VAR_1,g(VAR_0,VAR_1))
| f(g(VAR_0,VAR_1),VAR_1)
| f(VAR_0,g(VAR_0,VAR_1)) ),
file('theBenchmark.p',clause5) ).
cnf(c_5,plain,
( f(g(A,B),w(A))
| f(B,g(A,B))
| f(g(A,B),B)
| f(A,g(A,B)) ),
inference(clausify,[status(thm)],[clause5]) ).
fof(clause8,axiom,
! [VAR_0,VAR_1] :
( ~ f(g(VAR_0,VAR_1),w(VAR_0))
| f(VAR_1,g(VAR_0,VAR_1))
| ~ f(g(VAR_0,VAR_1),VAR_1)
| f(VAR_0,g(VAR_0,VAR_1)) ),
file('theBenchmark.p',clause8) ).
cnf(c_8,plain,
( ~ f(g(A,B),w(A))
| f(B,g(A,B))
| ~ f(g(A,B),B)
| f(A,g(A,B)) ),
inference(clausify,[status(thm)],[clause8]) ).
fof(clause10,axiom,
! [VAR_0,VAR_1] :
( ~ f(g(VAR_0,VAR_1),w(VAR_0))
| ~ f(VAR_1,g(VAR_0,VAR_1))
| ~ f(g(VAR_0,VAR_1),VAR_1)
| ~ f(VAR_0,g(VAR_0,VAR_1)) ),
file('theBenchmark.p',clause10) ).
cnf(c_10,plain,
( ~ f(g(A,B),w(A))
| ~ f(B,g(A,B))
| ~ f(g(A,B),B)
| ~ f(A,g(A,B)) ),
inference(clausify,[status(thm)],[clause10]) ).
cnf(c_12,plain,
( ~ f(w(A),g(A,w(A)))
| f(g(A,w(A)),w(A))
| ~ f(A,g(A,w(A))) ),
inference(factor,[status(thm)],[c_3]) ).
cnf(c_14,plain,
( f(w(A),g(A,w(A)))
| f(g(A,w(A)),w(A))
| f(A,g(A,w(A))) ),
inference(factor,[status(thm)],[c_5]) ).
cnf(c_16,plain,
( f(w(A),g(A,w(A)))
| ~ f(g(A,w(A)),w(A))
| f(A,g(A,w(A))) ),
inference(factor,[status(thm)],[c_8]) ).
cnf(c_18,plain,
( ~ f(w(A),g(A,w(A)))
| ~ f(g(A,w(A)),w(A))
| ~ f(A,g(A,w(A))) ),
inference(factor,[status(thm)],[c_10]) ).
cnf(c_26,plain,
( f(w(A),g(A,w(A)))
| f(A,g(A,w(A)))
| f(w(A),g(A,w(A)))
| f(A,g(A,w(A))) ),
inference(resolve,[status(thm)],[c_16,c_14]) ).
cnf(c_27,plain,
( f(w(A),g(A,w(A)))
| f(w(A),g(A,w(A)))
| f(A,g(A,w(A))) ),
inference(copy,[status(thm)],[c_26]) ).
cnf(c_19,plain,
( f(w(A),g(A,w(A)))
| f(A,g(A,w(A))) ),
inference(copy,[status(thm)],[c_27]) ).
cnf(c_28,plain,
( f(A,g(A,w(A)))
| f(A,g(A,w(A))) ),
inference(resolve,[status(thm)],[c_19,c_1]) ).
cnf(c_20,plain,
f(A,g(A,w(A))),
inference(copy,[status(thm)],[c_28]) ).
cnf(c_21,plain,
( ~ f(w(A),g(A,w(A)))
| ~ f(g(A,w(A)),w(A)) ),
inference(resolve,[status(thm)],[c_20,c_18]) ).
cnf(c_22,plain,
( ~ f(w(A),g(A,w(A)))
| f(g(A,w(A)),w(A)) ),
inference(resolve,[status(thm)],[c_20,c_12]) ).
cnf(c_23,plain,
f(w(A),g(A,w(A))),
inference(resolve,[status(thm)],[c_20,c_2]) ).
cnf(c_24,plain,
f(g(A,w(A)),w(A)),
inference(resolve,[status(thm)],[c_23,c_22]) ).
cnf(c_29,plain,
~ f(w(A),g(A,w(A))),
inference(resolve,[status(thm)],[c_24,c_21]) ).
cnf(c_25,plain,
$false,
inference(resolve,[status(thm)],[c_23,c_29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN349-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 17:34:53 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.36 % Process 91661 was started by sandbox on n007,
% 0.10/0.36 % Sat Sep 26 17:34:53 2026
% 0.10/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.37
% 0.10/0.37 % From the command line: assign(max_seconds, 300).
% 0.10/0.37
% 0.10/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.37
% 0.10/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.37 % Length of proof is 17.
% 0.10/0.37 % Level of proof is 6.
% 0.10/0.37 % Maximum clause weight is 35.000.
% 0.10/0.37 % Given clauses 20.
% 0.10/0.37
% 0.10/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------