%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL129-1 : TPTP v9.2.1. Released v1.0.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 : n027.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:39:29 PM UTC 2026
% Result : Unsatisfiable 134.92s 103.00s
% Output : CNFRefutation 135.52s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named i_0_8)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_lg_2,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_2) ).
cnf(s_4,axiom,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X1,equivalent(X4,X3)),equivalent(X2,X4)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_4) ).
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(i_0_3,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
prove_lg_2,
[final] ).
cnf(i_0_4,axiom,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X1,equivalent(X4,X3)),equivalent(X2,X4)))),
s_4,
[final] ).
cnf(i_0_5,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment,
[final] ).
cnf(i_0_38,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X3)))),
inference(scs_inference,[],[i_0_8,i_0_4,i_0_5]) ).
cnf(i_0_56,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)),
inference(scs_inference,[],[i_0_8,i_0_38,i_0_47,i_0_6,i_0_5]) ).
cnf(i_0_62,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)),
inference(rename_variables,[],[i_0_56]) ).
cnf(i_0_76,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)),
inference(rename_variables,[],[i_0_56]) ).
cnf(i_0_590,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)),
inference(rename_variables,[],[i_0_56]) ).
cnf(i_0_599,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)),
inference(rename_variables,[],[i_0_56]) ).
cnf(i_0_74,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)),X1)),
inference(scs_inference,[],[i_0_8,i_0_61,i_0_56,i_0_6,i_0_5]) ).
cnf(c_0_80,axiom,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(X2) ),
i_0_5 ).
cnf(c_0_81,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)),
i_0_56 ).
cnf(c_0_82,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,equivalent(X2,X2))) ),
inference(pm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_83,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)),X1)),
i_0_74 ).
cnf(c_0_84,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),equivalent(X2,X3)),equivalent(X3,X2))),
inference(pm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_85,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X3),equivalent(X2,X1))) ),
inference(pm,[status(thm)],[c_0_80,c_0_84]) ).
cnf(c_0_86,axiom,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X1,equivalent(X4,X3)),equivalent(X2,X4)))),
i_0_4 ).
cnf(c_0_87,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),
inference(pm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_88,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(pm,[status(thm)],[c_0_80,c_0_87]) ).
cnf(c_0_89,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2))) ),
inference(pm,[status(thm)],[c_0_80,c_0_83]) ).
cnf(c_0_90,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
i_0_3 ).
cnf(c_0_91,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(X3,X1)) ),
inference(pm,[status(thm)],[c_0_80,c_0_88]) ).
cnf(c_0_92,plain,
is_a_theorem(equivalent(X1,X1)),
inference(pm,[status(thm)],[c_0_89,c_0_81]) ).
cnf(c_0_93,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(pm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_94,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(pm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_95,plain,
( ~ is_a_theorem(equivalent(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),X1))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(pm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_96,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X4,X2)))
| ~ is_a_theorem(equivalent(X1,equivalent(X4,X3))) ),
inference(pm,[status(thm)],[c_0_80,c_0_86]) ).
cnf(c_0_97,plain,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e)))))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,c)),a)) ),
inference(pm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_98,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(b,e),equivalent(c,e)))))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(b,c)),a))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(pm,[status(thm)],[c_0_97,c_0_91]) ).
cnf(c_0_99,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(c,e)),equivalent(b,c)),a))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,e)),a)) ),
inference(pm,[status(thm)],[c_0_98,c_0_87]) ).
cnf(c_0_100,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X4,X2)),X5))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X4,X3)),X5)) ),
inference(pm,[status(thm)],[c_0_91,c_0_86]) ).
cnf(c_0_101,plain,
~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,e)),a)),
inference(pm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_102,plain,
$false,
inference(pm,[status(thm)],[c_0_101,c_0_83]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL129-1 : TPTP v9.2.1. Released v1.0.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 : n027.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 22:03:35 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 134.92/103.00 % Version : CSE_E---1.7
% 134.92/103.00 % Problem : theBenchmark.p
% 134.92/103.00 % SZS status Unsatisfiable for theBenchmark.p
% 134.92/103.00 % SZS output start CNFRefutation
% See solution above
% 135.52/103.54 % Total time : 102.636s
%------------------------------------------------------------------------------