%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SWC128-1 : TPTP v9.3.1. Bugfixed v3.0.0.
% Transfm : none
% Format : tptp:raw
% Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.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 : Wed Oct 7 10:52:20 AM UTC 2026
% Result : Unsatisfiable 0.71s 0.35s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 27 ( 8 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &; 0 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 71 ( 68 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_app,type,
app: $i > $i > $i ).
thf(tp_cons,type,
cons: $i > $i > $i ).
thf(tp_cyclefreeP,type,
cyclefreeP: $i > $o ).
thf(tp_duplicatefreeP,type,
duplicatefreeP: $i > $o ).
thf(tp_equalelemsP,type,
equalelemsP: $i > $o ).
thf(tp_frontsegP,type,
frontsegP: $i > $i > $o ).
thf(tp_geq,type,
geq: $i > $i > $o ).
thf(tp_gt,type,
gt: $i > $i > $o ).
thf(tp_hd,type,
hd: $i > $i ).
thf(tp_leq,type,
leq: $i > $i > $o ).
thf(tp_lt,type,
lt: $i > $i > $o ).
thf(tp_memberP,type,
memberP: $i > $i > $o ).
thf(tp_neq,type,
neq: $i > $i > $o ).
thf(tp_nil,type,
nil: $i ).
thf(tp_rearsegP,type,
rearsegP: $i > $i > $o ).
thf(tp_segmentP,type,
segmentP: $i > $i > $o ).
thf(tp_singletonP,type,
singletonP: $i > $o ).
thf(tp_skac2,type,
skac2: $i ).
thf(tp_skac3,type,
skac3: $i ).
thf(tp_skaf42,type,
skaf42: $i > $i > $i ).
thf(tp_skaf43,type,
skaf43: $i > $i > $i ).
thf(tp_skaf44,type,
skaf44: $i > $i ).
thf(tp_skaf45,type,
skaf45: $i > $i > $i ).
thf(tp_skaf46,type,
skaf46: $i > $i > $i ).
thf(tp_skaf47,type,
skaf47: $i > $i > $i ).
thf(tp_skaf48,type,
skaf48: $i > $i > $i ).
thf(tp_skaf49,type,
skaf49: $i > $i ).
thf(tp_skaf50,type,
skaf50: $i > $i ).
thf(tp_skaf51,type,
skaf51: $i > $i ).
thf(tp_skaf52,type,
skaf52: $i > $i ).
thf(tp_skaf53,type,
skaf53: $i > $i ).
thf(tp_skaf54,type,
skaf54: $i > $i ).
thf(tp_skaf55,type,
skaf55: $i > $i ).
thf(tp_skaf56,type,
skaf56: $i > $i ).
thf(tp_skaf57,type,
skaf57: $i > $i ).
thf(tp_skaf58,type,
skaf58: $i > $i ).
thf(tp_skaf59,type,
skaf59: $i > $i ).
thf(tp_skaf60,type,
skaf60: $i > $i ).
thf(tp_skaf61,type,
skaf61: $i > $i ).
thf(tp_skaf62,type,
skaf62: $i > $i ).
thf(tp_skaf63,type,
skaf63: $i > $i ).
thf(tp_skaf64,type,
skaf64: $i > $i ).
thf(tp_skaf65,type,
skaf65: $i > $i ).
thf(tp_skaf66,type,
skaf66: $i > $i ).
thf(tp_skaf67,type,
skaf67: $i > $i ).
thf(tp_skaf68,type,
skaf68: $i > $i ).
thf(tp_skaf69,type,
skaf69: $i > $i ).
thf(tp_skaf70,type,
skaf70: $i > $i ).
thf(tp_skaf71,type,
skaf71: $i > $i ).
thf(tp_skaf72,type,
skaf72: $i > $i ).
thf(tp_skaf73,type,
skaf73: $i > $i ).
thf(tp_skaf74,type,
skaf74: $i > $i ).
thf(tp_skaf75,type,
skaf75: $i > $i ).
thf(tp_skaf76,type,
skaf76: $i > $i ).
thf(tp_skaf77,type,
skaf77: $i > $i ).
thf(tp_skaf78,type,
skaf78: $i > $i ).
thf(tp_skaf79,type,
skaf79: $i > $i ).
thf(tp_skaf80,type,
skaf80: $i > $i ).
thf(tp_skaf81,type,
skaf81: $i > $i ).
thf(tp_skaf82,type,
skaf82: $i > $i ).
thf(tp_skaf83,type,
skaf83: $i > $i ).
thf(tp_ssItem,type,
ssItem: $i > $o ).
thf(tp_ssList,type,
ssList: $i > $o ).
thf(tp_strictorderP,type,
strictorderP: $i > $o ).
thf(tp_strictorderedP,type,
strictorderedP: $i > $o ).
thf(tp_tl,type,
tl: $i > $i ).
thf(tp_totalorderP,type,
totalorderP: $i > $o ).
thf(tp_totalorderedP,type,
totalorderedP: $i > $o ).
thf(186,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(187,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[186]) ).
thf(188,negated_conjecture,
$false,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
thf(189,plain,
$false = $false,
inference(unfold_def,[status(thm)],[187]) ).
thf(190,plain,
$false = $true,
inference(unfold_def,[status(thm)],[188]) ).
thf(191,plain,
( ( ~ $false ) = $true ),
inference(polarity_switch,[status(thm)],[189]) ).
thf(192,plain,
$false = $true,
inference(copy,[status(thm)],[190]) ).
thf(193,plain,
( ( ~ $false ) = $true ),
inference(copy,[status(thm)],[191]) ).
thf(194,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[193]) ).
thf(195,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[192,194]) ).
thf(196,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[195]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC128-1 : TPTP v9.3.1. Bugfixed v3.0.0.
% 0.00/0.04 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.18 % Computer : n015.cluster.edu
% 0.11/0.18 % Model : x86_64 x86_64
% 0.11/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18 % Memory : 8046.5625MB
% 0.11/0.18 % OS : Linux 6.8.0-71-generic
% 0.11/0.18 % CPULimit : 300
% 0.11/0.18 % WCLimit : 300
% 0.11/0.18 % DateTime : Tue Oct 6 16:04:28 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.19 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.71/0.35 .
% 0.71/0.35
% 0.71/0.35 No.of.Axioms: 1
% 0.71/0.35
% 0.71/0.35 Length.of.Defs: 0
% 0.71/0.35
% 0.71/0.35 Contains.Choice.Funs: false
% 0.71/0.35 .
% 0.71/0.35
% 0.71/0.35 ********************************
% 0.71/0.35 * All subproblems solved! *
% 0.71/0.35 ********************************
% 0.71/0.35 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:1,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:195,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.71/0.35
% 0.71/0.35 %**** Beginning of derivation protocol ****
% 0.71/0.35 % SZS output start CNFRefutation
% See solution above
% 0.71/0.35
% 0.71/0.35 %**** End of derivation protocol ****
% 0.71/0.35 %**** no. of clauses in derivation: 11 ****
% 0.71/0.35 %**** clause counter: 195 ****
% 0.71/0.35
% 0.71/0.35 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:1,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:195,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------