TSTP Solution File: LCL490+1 by leanCoP---2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : leanCoP---2.2
% Problem : LCL490+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : leancop_casc.sh %s %d
% Computer : n020.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 : 600s
% DateTime : Sun Jul 17 12:16:10 EDT 2022
% Result : Theorem 0.62s 1.41s
% Output : Proof 0.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL490+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : leancop_casc.sh %s %d
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 03:35:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.62/1.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.62/1.41 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.62/1.42
% 0.62/1.42 %-----------------------------------------------------
% 0.62/1.42 fof(hilbert_or_1, conjecture, or_1, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', hilbert_or_1)).
% 0.62/1.42 fof(principia_op_implies_or, axiom, op_implies_or, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax', principia_op_implies_or)).
% 0.62/1.42 fof(principia_modus_ponens, axiom, modus_ponens, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax', principia_modus_ponens)).
% 0.62/1.42 fof(principia_r2, axiom, r2, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax', principia_r2)).
% 0.62/1.42 fof(principia_r3, axiom, r3, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax', principia_r3)).
% 0.62/1.42 fof(principia_r5, axiom, r5, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax', principia_r5)).
% 0.62/1.42 fof(op_implies_or, axiom, op_implies_or => ! [_51834, _51837] : implies(_51834, _51837) = or(not _51834, _51837), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax', op_implies_or)).
% 0.62/1.42 fof(modus_ponens, axiom, modus_ponens <=> ! [_52005, _52008] : (is_a_theorem(_52005) & is_a_theorem(implies(_52005, _52008)) => is_a_theorem(_52008)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', modus_ponens)).
% 0.62/1.42 fof(or_1, axiom, or_1 <=> ! [_52204, _52207] : is_a_theorem(implies(_52204, or(_52204, _52207))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', or_1)).
% 0.62/1.42 fof(r2, axiom, r2 <=> ! [_52383, _52386] : is_a_theorem(implies(_52386, or(_52383, _52386))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', r2)).
% 0.62/1.42 fof(r3, axiom, r3 <=> ! [_52539, _52542] : is_a_theorem(implies(or(_52539, _52542), or(_52542, _52539))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', r3)).
% 0.62/1.42 fof(r5, axiom, r5 <=> ! [_52713, _52716, _52719] : is_a_theorem(implies(implies(_52716, _52719), implies(or(_52713, _52716), or(_52713, _52719)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', r5)).
% 0.62/1.42
% 0.62/1.42 cnf(1, plain, [or_1], clausify(hilbert_or_1)).
% 0.62/1.42 cnf(2, plain, [-(is_a_theorem(_16619)), _16570 = _16619, is_a_theorem(_16570)], theory(equality)).
% 0.62/1.42 cnf(3, plain, [-(_15672 = _15672)], theory(equality)).
% 0.62/1.42 cnf(4, plain, [_15825 = _15870, -(_15870 = _15825)], theory(equality)).
% 0.62/1.42 cnf(5, plain, [-(_16104 = _16215), _16104 = _16160, _16160 = _16215], theory(equality)).
% 0.62/1.42 cnf(6, plain, [-(op_implies_or)], clausify(principia_op_implies_or)).
% 0.62/1.42 cnf(7, plain, [-(modus_ponens)], clausify(principia_modus_ponens)).
% 0.62/1.42 cnf(8, plain, [-(r2)], clausify(principia_r2)).
% 0.62/1.42 cnf(9, plain, [-(r3)], clausify(principia_r3)).
% 0.62/1.42 cnf(10, plain, [-(r5)], clausify(principia_r5)).
% 0.62/1.42 cnf(11, plain, [op_implies_or, -(implies(_31628, _31675) = or(not _31628, _31675))], clausify(op_implies_or)).
% 0.62/1.42 cnf(12, plain, [modus_ponens, -(is_a_theorem(_19908)), is_a_theorem(_19857), is_a_theorem(implies(_19857, _19908))], clausify(modus_ponens)).
% 0.62/1.42 cnf(13, plain, [-(or_1), is_a_theorem(implies(20 ^ [], or(20 ^ [], 21 ^ [])))], clausify(or_1)).
% 0.62/1.42 cnf(14, plain, [r2, -(is_a_theorem(implies(_28353, or(_28309, _28353))))], clausify(r2)).
% 0.62/1.42 cnf(15, plain, [r3, -(is_a_theorem(implies(or(_28633, _28680), or(_28680, _28633))))], clausify(r3)).
% 0.62/1.42 cnf(16, plain, [r5, -(is_a_theorem(implies(implies(_29574, _29631), implies(or(_29516, _29574), or(_29516, _29631)))))], clausify(r5)).
% 0.62/1.42
% 0.62/1.42 cnf('1',plain,[or_1],start(1)).
% 0.62/1.42 cnf('1.1',plain,[-(or_1), is_a_theorem(implies(20 ^ [], or(20 ^ [], 21 ^ [])))],extension(13)).
% 0.62/1.42 cnf('1.1.1',plain,[-(is_a_theorem(implies(20 ^ [], or(20 ^ [], 21 ^ [])))), or(not 20 ^ [], or(20 ^ [], 21 ^ [])) = implies(20 ^ [], or(20 ^ [], 21 ^ [])), is_a_theorem(or(not 20 ^ [], or(20 ^ [], 21 ^ [])))],extension(2,bind([[_16619, _16570], [implies(20 ^ [], or(20 ^ [], 21 ^ [])), or(not 20 ^ [], or(20 ^ [], 21 ^ []))]]))).
% 0.62/1.42 cnf('1.1.1.1',plain,[-(or(not 20 ^ [], or(20 ^ [], 21 ^ [])) = implies(20 ^ [], or(20 ^ [], 21 ^ []))), implies(20 ^ [], or(20 ^ [], 21 ^ [])) = or(not 20 ^ [], or(20 ^ [], 21 ^ []))],extension(4,bind([[_15825, _15870], [implies(20 ^ [], or(20 ^ [], 21 ^ [])), or(not 20 ^ [], or(20 ^ [], 21 ^ []))]]))).
% 0.62/1.42 cnf('1.1.1.1.1',plain,[-(implies(20 ^ [], or(20 ^ [], 21 ^ [])) = or(not 20 ^ [], or(20 ^ [], 21 ^ []))), implies(20 ^ [], or(20 ^ [], 21 ^ [])) = or(not 20 ^ [], or(20 ^ [], 21 ^ [])), or(not 20 ^ [], or(20 ^ [], 21 ^ [])) = or(not 20 ^ [], or(20 ^ [], 21 ^ []))],extension(5,bind([[_16104, _16160, _16215], [implies(20 ^ [], or(20 ^ [], 21 ^ [])), or(not 20 ^ [], or(20 ^ [], 21 ^ [])), or(not 20 ^ [], or(20 ^ [], 21 ^ []))]]))).
% 0.62/1.42 cnf('1.1.1.1.1.1',plain,[-(implies(20 ^ [], or(20 ^ [], 21 ^ [])) = or(not 20 ^ [], or(20 ^ [], 21 ^ []))), op_implies_or],extension(11,bind([[_31628, _31675], [20 ^ [], or(20 ^ [], 21 ^ [])]]))).
% 0.62/1.42 cnf('1.1.1.1.1.1.1',plain,[-(op_implies_or)],extension(6)).
% 0.62/1.42 cnf('1.1.1.1.1.2',plain,[-(or(not 20 ^ [], or(20 ^ [], 21 ^ [])) = or(not 20 ^ [], or(20 ^ [], 21 ^ [])))],extension(3,bind([[_15672], [or(not 20 ^ [], or(20 ^ [], 21 ^ []))]]))).
% 0.62/1.42 cnf('1.1.1.2',plain,[-(is_a_theorem(or(not 20 ^ [], or(20 ^ [], 21 ^ [])))), modus_ponens, is_a_theorem(or(not 20 ^ [], or(21 ^ [], 20 ^ []))), is_a_theorem(implies(or(not 20 ^ [], or(21 ^ [], 20 ^ [])), or(not 20 ^ [], or(20 ^ [], 21 ^ []))))],extension(12,bind([[_19857, _19908], [or(not 20 ^ [], or(21 ^ [], 20 ^ [])), or(not 20 ^ [], or(20 ^ [], 21 ^ []))]]))).
% 0.62/1.42 cnf('1.1.1.2.1',plain,[-(modus_ponens)],extension(7)).
% 0.62/1.42 cnf('1.1.1.2.2',plain,[-(is_a_theorem(or(not 20 ^ [], or(21 ^ [], 20 ^ [])))), implies(20 ^ [], or(21 ^ [], 20 ^ [])) = or(not 20 ^ [], or(21 ^ [], 20 ^ [])), is_a_theorem(implies(20 ^ [], or(21 ^ [], 20 ^ [])))],extension(2,bind([[_16619, _16570], [or(not 20 ^ [], or(21 ^ [], 20 ^ [])), implies(20 ^ [], or(21 ^ [], 20 ^ []))]]))).
% 0.62/1.42 cnf('1.1.1.2.2.1',plain,[-(implies(20 ^ [], or(21 ^ [], 20 ^ [])) = or(not 20 ^ [], or(21 ^ [], 20 ^ []))), op_implies_or],extension(11,bind([[_31628, _31675], [20 ^ [], or(21 ^ [], 20 ^ [])]]))).
% 0.62/1.42 cnf('1.1.1.2.2.1.1',plain,[-(op_implies_or)],extension(6)).
% 0.62/1.42 cnf('1.1.1.2.2.2',plain,[-(is_a_theorem(implies(20 ^ [], or(21 ^ [], 20 ^ [])))), r2],extension(14,bind([[_28309, _28353], [21 ^ [], 20 ^ []]]))).
% 0.62/1.42 cnf('1.1.1.2.2.2.1',plain,[-(r2)],extension(8)).
% 0.62/1.42 cnf('1.1.1.2.3',plain,[-(is_a_theorem(implies(or(not 20 ^ [], or(21 ^ [], 20 ^ [])), or(not 20 ^ [], or(20 ^ [], 21 ^ []))))), modus_ponens, is_a_theorem(implies(or(21 ^ [], 20 ^ []), or(20 ^ [], 21 ^ []))), is_a_theorem(implies(implies(or(21 ^ [], 20 ^ []), or(20 ^ [], 21 ^ [])), implies(or(not 20 ^ [], or(21 ^ [], 20 ^ [])), or(not 20 ^ [], or(20 ^ [], 21 ^ [])))))],extension(12,bind([[_19857, _19908], [implies(or(21 ^ [], 20 ^ []), or(20 ^ [], 21 ^ [])), implies(or(not 20 ^ [], or(21 ^ [], 20 ^ [])), or(not 20 ^ [], or(20 ^ [], 21 ^ [])))]]))).
% 0.62/1.42 cnf('1.1.1.2.3.1',plain,[-(modus_ponens)],extension(7)).
% 0.62/1.42 cnf('1.1.1.2.3.2',plain,[-(is_a_theorem(implies(or(21 ^ [], 20 ^ []), or(20 ^ [], 21 ^ [])))), r3],extension(15,bind([[_28680, _28633], [20 ^ [], 21 ^ []]]))).
% 0.62/1.42 cnf('1.1.1.2.3.2.1',plain,[-(r3)],extension(9)).
% 0.62/1.42 cnf('1.1.1.2.3.3',plain,[-(is_a_theorem(implies(implies(or(21 ^ [], 20 ^ []), or(20 ^ [], 21 ^ [])), implies(or(not 20 ^ [], or(21 ^ [], 20 ^ [])), or(not 20 ^ [], or(20 ^ [], 21 ^ [])))))), r5],extension(16,bind([[_29574, _29516, _29631], [or(21 ^ [], 20 ^ []), not 20 ^ [], or(20 ^ [], 21 ^ [])]]))).
% 0.62/1.42 cnf('1.1.1.2.3.3.1',plain,[-(r5)],extension(10)).
% 0.62/1.42 %-----------------------------------------------------
% 0.62/1.43
% 0.62/1.43 % SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
%------------------------------------------------------------------------------