%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET563-6 : TPTP v9.2.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n019.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:08:00 PM UTC 2026
% Result : Unsatisfiable 1.32s 1.74s
% Output : CNFRefutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 13 unt; 0 nHn; 14 RR)
% Number of literals : 23 ( 7 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 19 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatible3,axiom,
( subclass(range_of(X1),domain_of(domain_of(X3)))
| ~ compatible(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',compatible3) ).
cnf(range_of,axiom,
domain_of(inverse(X1)) = range_of(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',range_of) ).
cnf(inverse,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',inverse) ).
cnf(compatible2,axiom,
( domain_of(domain_of(X2)) = domain_of(X1)
| ~ compatible(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',compatible2) ).
cnf(prove_compatible_function_property3_2,negated_conjecture,
compatible(xh2,xf2,xf3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_compatible_function_property3_2) ).
cnf(prove_compatible_function_property3_3,negated_conjecture,
~ subclass(range_of(xh1),domain_of(xh2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_compatible_function_property3_3) ).
cnf(prove_compatible_function_property3_1,negated_conjecture,
compatible(xh1,xf1,xf2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_compatible_function_property3_1) ).
cnf(c_0_7,axiom,
( subclass(range_of(X1),domain_of(domain_of(X3)))
| ~ compatible(X1,X2,X3) ),
compatible3 ).
cnf(c_0_8,axiom,
domain_of(inverse(X1)) = range_of(X1),
range_of ).
cnf(c_0_9,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inverse ).
cnf(c_0_10,axiom,
( domain_of(domain_of(X2)) = domain_of(X1)
| ~ compatible(X1,X2,X3) ),
compatible2 ).
cnf(c_0_11,negated_conjecture,
compatible(xh2,xf2,xf3),
prove_compatible_function_property3_2 ).
cnf(c_0_12,negated_conjecture,
~ subclass(range_of(xh1),domain_of(xh2)),
prove_compatible_function_property3_3 ).
cnf(c_0_13,plain,
( subclass(domain_of(domain_of(flip(cross_product(X1,universal_class)))),domain_of(domain_of(X3)))
| ~ compatible(X1,X2,X3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_14,negated_conjecture,
compatible(xh1,xf1,xf2),
prove_compatible_function_property3_1 ).
cnf(c_0_15,negated_conjecture,
domain_of(domain_of(xf2)) = domain_of(xh2),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ subclass(domain_of(domain_of(flip(cross_product(xh1,universal_class)))),domain_of(xh2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8]),c_0_9]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET563-6 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n019.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 02:27:29 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.32/1.74 % Version : CSE_E---1.7
% 1.32/1.74 % Problem : theBenchmark.p
% 1.32/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 1.32/1.74 % SZS output start CNFRefutation
% See solution above
% 1.32/1.74 % Total time : 1.371s
%------------------------------------------------------------------------------