%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CSR256+1 : TPTP v9.2.1. Released v7.3.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 : n025.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 04:16:12 PM UTC 2026
% Result : Theorem 11.39s 7.13s
% Output : CNFRefutation 11.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 11 unt; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 6 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 11 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(predefinitionsA8,axiom,
! [X1,X2,X3] :
( ( p__d__subclass(X1,X2)
& p__d__subclass(X2,X3) )
=> p__d__subclass(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA8) ).
fof(mergeA2519,axiom,
p__d__subclass(c__ChangeOfPossession,c__SocialInteraction),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2519) ).
fof(mergeA2523,axiom,
p__d__subclass(c__Giving,c__ChangeOfPossession),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2523) ).
fof(subclassEvent0321,conjecture,
p__d__subclass(c__Funding,c__SocialInteraction),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclassEvent0321) ).
fof(mergeA2526,axiom,
p__d__subclass(c__Funding,c__Giving),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2526) ).
fof(c_0_5,plain,
! [X7770,X7771,X7772] :
( ~ p__d__subclass(X7770,X7771)
| ~ p__d__subclass(X7771,X7772)
| p__d__subclass(X7770,X7772) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA8])]) ).
cnf(c_0_6,plain,
( p__d__subclass(X1,X3)
| ~ p__d__subclass(X1,X2)
| ~ p__d__subclass(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,plain,
p__d__subclass(c__ChangeOfPossession,c__SocialInteraction),
inference(split_conjunct,[status(thm)],[mergeA2519]) ).
cnf(c_0_8,plain,
( p__d__subclass(X1,c__SocialInteraction)
| ~ p__d__subclass(X1,c__ChangeOfPossession) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
p__d__subclass(c__Giving,c__ChangeOfPossession),
inference(split_conjunct,[status(thm)],[mergeA2523]) ).
cnf(c_0_10,plain,
p__d__subclass(c__Giving,c__SocialInteraction),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
fof(c_0_11,negated_conjecture,
~ p__d__subclass(c__Funding,c__SocialInteraction),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[subclassEvent0321])]) ).
cnf(c_0_12,plain,
( p__d__subclass(X1,c__SocialInteraction)
| ~ p__d__subclass(X1,c__Giving) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_13,plain,
p__d__subclass(c__Funding,c__Giving),
inference(split_conjunct,[status(thm)],[mergeA2526]) ).
cnf(c_0_14,negated_conjecture,
~ p__d__subclass(c__Funding,c__SocialInteraction),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR256+1 : TPTP v9.2.1. Released v7.3.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.15/0.33 % Computer : n025.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 17:14:58 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 11.39/7.13 % Version : CSE_E---1.7
% 11.39/7.13 % Problem : theBenchmark.p
% 11.39/7.13 % SZS status Theorem for theBenchmark.p
% 11.39/7.13 % SZS output start CNFRefutation
% See solution above
% 11.39/7.13 % Total time : 6.280s
%------------------------------------------------------------------------------