%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : LCL112-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n002.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 : Mon Sep 7 11:18:39 AM UTC 2026
% Result : Unsatisfiable 58.30s 58.40s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL112-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.07/0.32 % Computer : n002.cluster.edu
% 0.07/0.32 % Model : x86_64 x86_64
% 0.07/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.32 % Memory : 8046.5625MB
% 0.07/0.32 % OS : Linux 6.8.0-71-generic
% 0.07/0.32 % CPULimit : 300
% 0.07/0.32 % WCLimit : 300
% 0.07/0.32 % DateTime : Sat Sep 5 08:07:05 UTC 2026
% 0.07/0.33 % CPUTime :
% 0.27/0.49 start to proof:theBenchmark
% 58.19/58.39 %-------------------------------------------
% 58.19/58.39 % File :CSE---1.7
% 58.19/58.39 % Problem :theBenchmark
% 58.19/58.39 % Transform :cnf
% 58.19/58.39 % Format :tptp:raw
% 58.19/58.39 % Command :java -jar mcs_scs.jar %d %s
% 58.19/58.39
% 58.19/58.39 % Result :Theorem 57.918297s
% 58.19/58.39 % Output :CNFRefutation 57.918297s
% 58.19/58.39 %-------------------------------------------
% 58.19/58.40 %--------------------------------------------------------------------------
% 58.19/58.40 % File : LCL112-1 : TPTP v9.3.1. Released v1.0.0.
% 58.19/58.40 % Domain : Logic Calculi (Many valued sentential)
% 58.19/58.40 % Problem : MV-29 depnds on the Meredith system
% 58.19/58.40 % Version : [McC92] axioms.
% 58.19/58.40 % English : An axiomatisation of the many valued sentential calculus
% 58.30/58.40 % is {MV-1,MV-2,MV-3,MV-5} by Meredith. Show that 29 depends
% 58.30/58.40 % on the Meredith system.
% 58.30/58.40
% 58.30/58.40 % Refs : [MW92] McCune & Wos (1992), Experiments in Automated Deductio
% 58.30/58.40 % : [McC92] McCune (1992), Email to G. Sutcliffe
% 58.30/58.40 % Source : [McC92]
% 58.30/58.40 % Names : MV-58 [MW92]
% 58.30/58.40 % : mv.in part 3 [OTTER]
% 58.30/58.40
% 58.30/58.40 % Status : Unsatisfiable
% 58.30/58.40 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.15 v5.2.0, 0.08 v5.1.0, 0.06 v5.0.0, 0.07 v4.0.1, 0.00 v2.6.0, 0.14 v2.5.0, 0.00 v2.4.0, 0.00 v2.3.0, 0.14 v2.2.1, 0.11 v2.1.0, 0.13 v2.0.0
% 58.30/58.40 % Syntax : Number of clauses : 6 ( 5 unt; 0 nHn; 2 RR)
% 58.30/58.40 % Number of literals : 8 ( 0 equ; 3 neg)
% 58.30/58.40 % Maximal clause size : 3 ( 1 avg)
% 58.30/58.40 % Maximal term depth : 4 ( 2 avg)
% 58.30/58.40 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty)
% 58.30/58.40 % Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% 58.30/58.40 % Number of variables : 11 ( 1 sgn)
% 58.30/58.40 % SPC : CNF_UNS_RFO_NEQ_HRN
% 58.30/58.40
% 58.30/58.40 % Comments :
% 58.30/58.40 %--------------------------------------------------------------------------
% 58.30/58.40 cnf(condensed_detachment,axiom,
% 58.30/58.40 ( ~ is_a_theorem(implies(X,Y))
% 58.30/58.40 | ~ is_a_theorem(X)
% 58.30/58.40 | is_a_theorem(Y) ) ).
% 58.30/58.40
% 58.30/58.40 cnf(mv_1,axiom,
% 58.30/58.40 is_a_theorem(implies(X,implies(Y,X))) ).
% 58.30/58.40
% 58.30/58.40 cnf(mv_2,axiom,
% 58.30/58.40 is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))) ).
% 58.30/58.40
% 58.30/58.40 cnf(mv_3,axiom,
% 58.30/58.40 is_a_theorem(implies(implies(implies(X,Y),Y),implies(implies(Y,X),X))) ).
% 58.30/58.40
% 58.30/58.40 cnf(mv_5,axiom,
% 58.30/58.40 is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))) ).
% 58.30/58.40
% 58.30/58.40 cnf(prove_mv_29,negated_conjecture,
% 58.30/58.40 ~ is_a_theorem(implies(a,not(not(a)))) ).
% 58.30/58.40
% 58.30/58.40 %--------------------------------------------------------------------------
% 58.30/58.40 %-------------------------------------------
% 58.30/58.40 % Proof found
% 58.30/58.40 % SZS status Theorem for theBenchmark
% 58.30/58.40 % SZS output start Proof
% 58.30/58.40 %ClaNum:6(EqnAxiom:0)
% 58.30/58.40 %VarNum:23(SingletonVarNum:11)
% 58.30/58.40 %MaxLitNum:3
% 58.30/58.40 %MaxfuncDepth:3
% 58.30/58.40 %SharedTerms:5
% 58.30/58.40 %goalClause: 5
% 58.30/58.40 %singleGoalClaCount:1
% 58.30/58.40 [5]~P1(f1(a2,f3(f3(a2))))
% 58.30/58.40 [1]P1(f1(x11,f1(x12,x11)))
% 58.30/58.40 [2]P1(f1(f1(f3(x21),f3(x22)),f1(x22,x21)))
% 58.30/58.40 [4]P1(f1(f1(f1(x41,x42),x42),f1(f1(x42,x41),x41)))
% 58.30/58.40 [3]P1(f1(f1(x31,x32),f1(f1(x32,x33),f1(x31,x33))))
% 58.30/58.40 [6]P1(x61)+~P1(x62)+~P1(f1(x62,x61))
% 58.30/58.40 %EqnAxiom
% 58.30/58.40
% 58.30/58.40 %-------------------------------------------
% 58.30/58.40 cnf(7,plain,
% 58.30/58.40 (~P1(f1(f3(f3(f3(a2))),f3(a2)))),
% 58.30/58.40 inference(scs_inference,[],[5,2,6])).
% 58.30/58.40 cnf(15,plain,
% 58.30/58.40 (P1(f1(f1(f1(x151,x152),x153),f1(x152,x153)))),
% 58.30/58.40 inference(scs_inference,[],[1,3,6])).
% 58.30/58.40 cnf(39,plain,
% 58.30/58.40 (P1(f1(f1(f1(x391,x392),x393),f1(f1(f3(x392),f3(x391)),x393)))),
% 58.30/58.40 inference(scs_inference,[],[2,3,6])).
% 58.30/58.40 cnf(45,plain,
% 58.30/58.40 (P1(f1(f1(f3(x451),f3(x452)),f1(f1(x451,x453),f1(x452,x453))))),
% 58.30/58.40 inference(scs_inference,[],[3,39,6])).
% 58.30/58.40 cnf(62,plain,
% 58.30/58.40 (~P1(f1(f1(x621,f3(f3(f3(a2)))),f3(a2)))),
% 58.30/58.40 inference(scs_inference,[],[7,15,6])).
% 58.30/58.40 cnf(65,plain,
% 58.30/58.40 (~P1(f1(f1(f3(f3(a2)),x651),f3(a2)))),
% 58.30/58.40 inference(scs_inference,[],[39,62,6])).
% 58.30/58.40 cnf(70,plain,
% 58.30/58.40 (~P1(f1(f1(x701,f3(a2)),f3(a2)))),
% 58.30/58.40 inference(scs_inference,[],[39,65,6])).
% 58.30/58.40 cnf(90,plain,
% 58.30/58.40 (~P1(f1(f1(f3(a2),x901),x901))),
% 58.30/58.40 inference(scs_inference,[],[70,4,6])).
% 58.30/58.40 cnf(133,plain,
% 58.30/58.40 ($false),
% 58.30/58.40 inference(scs_inference,[],[90,45,1,6]),
% 58.30/58.40 ['proof']).
% 58.30/58.40 % SZS output end Proof
% 58.30/58.40 % Total time :57.918297s
%------------------------------------------------------------------------------