%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : CSR051+1 : TPTP v9.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n006.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 : Wed Apr 9 05:53:42 PM UTC 2025
% Result : Theorem 2.89s 1.62s
% Output : CNFRefutation 3.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 1 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 2 ( 1 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ isa > genls > genlpreds > genlinverse > disjointwith > thing > predicate > mtvisible > marriagelicensedocument > collection > binarypredicate > #nlpp > c_tptpmarriagelicensedocument > c_tptp_member3356_mt > c_marriagelicensedocument > c_basekb
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(mtvisible,type,
mtvisible: $i > $o ).
tff(genls,type,
genls: ( $i * $i ) > $o ).
tff(genlpreds,type,
genlpreds: ( $i * $i ) > $o ).
tff(collection,type,
collection: $i > $o ).
tff(binarypredicate,type,
binarypredicate: $i > $o ).
tff(isa,type,
isa: ( $i * $i ) > $o ).
tff(predicate,type,
predicate: $i > $o ).
tff(disjointwith,type,
disjointwith: ( $i * $i ) > $o ).
tff(thing,type,
thing: $i > $o ).
tff(c_basekb,type,
c_basekb: $i ).
tff(c_tptpmarriagelicensedocument,type,
c_tptpmarriagelicensedocument: $i ).
tff(genlinverse,type,
genlinverse: ( $i * $i ) > $o ).
tff(c_marriagelicensedocument,type,
c_marriagelicensedocument: $i ).
tff(marriagelicensedocument,type,
marriagelicensedocument: $i > $o ).
tff(c_tptp_member3356_mt,type,
c_tptp_member3356_mt: $i ).
tff(f_168,negated_conjecture,
~ ? [X] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query51) ).
tff(f_37,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).
tff(c_58,plain,
! [X_55] : ~ marriagelicensedocument(X_55),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_56,plain,
mtvisible(c_tptp_member3356_mt),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_2,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_61,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_2]) ).
tff(c_62,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_58,c_61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR051+1 : TPTP v9.0.0. Released v3.4.0.
% 0.03/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Apr 7 16:55:08 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.89/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.89/1.63
% 2.89/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------