TSTP Solution File: LCL155-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL155-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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 : Fri May 3 02:37:00 EDT 2024
% Result : Unsatisfiable 0.47s 1.15s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
xor(x,x) != falsehood,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).
cnf(c_50,plain,
or(and(X0,not(X1)),and(not(X0),X1)) = xor(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',xor_definition) ).
cnf(c_55,plain,
not(truth) = falsehood,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',false_definition) ).
cnf(c_56,plain,
implies(not(X0),X1) = or(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_definition) ).
cnf(c_57,plain,
or(or(X0,X1),X2) = or(X0,or(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_associativity) ).
cnf(c_58,plain,
or(X0,X1) = or(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).
cnf(c_59,plain,
not(or(not(X0),not(X1))) = and(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',and_definition) ).
cnf(c_60,plain,
and(and(X0,X1),X2) = and(X0,and(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',and_associativity) ).
cnf(c_61,plain,
and(X0,X1) = and(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',and_commutativity) ).
cnf(c_62,plain,
implies(truth,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(c_64,plain,
implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(c_65,plain,
implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
cnf(c_118,plain,
implies(or(X0,not(X1)),implies(X1,X0)) = truth,
inference(demodulation,[status(thm)],[c_65,c_56]) ).
cnf(c_167,plain,
xor(x,x) = sP0_iProver_def,
definition ).
cnf(c_168,negated_conjecture,
sP0_iProver_def != falsehood,
inference(demodulation,[status(thm)],[c_49,c_167]) ).
cnf(c_256,plain,
implies(or(X0,not(truth)),X0) = truth,
inference(superposition,[status(thm)],[c_62,c_118]) ).
cnf(c_259,plain,
implies(or(X0,falsehood),X0) = truth,
inference(light_normalisation,[status(thm)],[c_256,c_55]) ).
cnf(c_264,plain,
or(truth,X0) = implies(falsehood,X0),
inference(superposition,[status(thm)],[c_55,c_56]) ).
cnf(c_289,plain,
implies(or(falsehood,X0),X0) = truth,
inference(superposition,[status(thm)],[c_58,c_259]) ).
cnf(c_297,plain,
or(X0,truth) = implies(falsehood,X0),
inference(superposition,[status(thm)],[c_264,c_58]) ).
cnf(c_300,plain,
implies(implies(falsehood,falsehood),truth) = truth,
inference(superposition,[status(thm)],[c_264,c_259]) ).
cnf(c_494,plain,
implies(implies(X0,truth),truth) = implies(X0,X0),
inference(superposition,[status(thm)],[c_62,c_64]) ).
cnf(c_760,plain,
implies(not(X0),not(X0)) = implies(or(X0,truth),truth),
inference(superposition,[status(thm)],[c_56,c_494]) ).
cnf(c_787,plain,
implies(not(X0),not(X0)) = implies(implies(falsehood,X0),truth),
inference(light_normalisation,[status(thm)],[c_760,c_297]) ).
cnf(c_791,plain,
implies(not(falsehood),not(falsehood)) = truth,
inference(demodulation,[status(thm)],[c_300,c_787]) ).
cnf(c_831,plain,
or(falsehood,not(falsehood)) = truth,
inference(demodulation,[status(thm)],[c_791,c_56]) ).
cnf(c_837,plain,
implies(truth,not(falsehood)) = truth,
inference(superposition,[status(thm)],[c_831,c_289]) ).
cnf(c_860,plain,
not(falsehood) = truth,
inference(demodulation,[status(thm)],[c_837,c_62]) ).
cnf(c_871,plain,
or(falsehood,X0) = implies(truth,X0),
inference(superposition,[status(thm)],[c_860,c_56]) ).
cnf(c_872,plain,
or(falsehood,X0) = X0,
inference(light_normalisation,[status(thm)],[c_871,c_62]) ).
cnf(c_882,plain,
implies(X0,X0) = truth,
inference(demodulation,[status(thm)],[c_289,c_872]) ).
cnf(c_940,plain,
or(X0,not(X0)) = truth,
inference(superposition,[status(thm)],[c_56,c_882]) ).
cnf(c_978,plain,
and(X0,not(X0)) = not(truth),
inference(superposition,[status(thm)],[c_940,c_59]) ).
cnf(c_989,plain,
and(X0,not(X0)) = falsehood,
inference(light_normalisation,[status(thm)],[c_978,c_55]) ).
cnf(c_1001,plain,
or(falsehood,and(not(X0),X0)) = xor(X0,X0),
inference(superposition,[status(thm)],[c_989,c_50]) ).
cnf(c_1006,plain,
or(falsehood,and(X0,not(X0))) = xor(X0,X0),
inference(theory_normalisation,[status(thm)],[c_1001,c_60,c_61,c_57,c_58]) ).
cnf(c_1007,plain,
xor(X0,X0) = or(falsehood,falsehood),
inference(light_normalisation,[status(thm)],[c_1006,c_989]) ).
cnf(c_1010,plain,
or(falsehood,falsehood) = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_167,c_1007]) ).
cnf(c_1035,plain,
falsehood = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_1010,c_872]) ).
cnf(c_1043,plain,
sP0_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_168,c_1035]) ).
cnf(c_1044,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_1043]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL155-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 : Thu May 2 19:01:02 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running UEQ theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.47/1.15 % SZS status Started for theBenchmark.p
% 0.47/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.15
% 0.47/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.47/1.15
% 0.47/1.15 ------ iProver source info
% 0.47/1.15
% 0.47/1.15 git: date: 2024-05-02 19:28:25 +0000
% 0.47/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.47/1.15 git: non_committed_changes: false
% 0.47/1.15
% 0.47/1.15 ------ Parsing...successful
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 ------ Preprocessing... sup_sim: 5 sf_s rm: 0 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.47/1.15
% 0.47/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.15
% 0.47/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.47/1.15 ------ Proving...
% 0.47/1.15 ------ Problem Properties
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 clauses 16
% 0.47/1.15 conjectures 1
% 0.47/1.15 EPR 1
% 0.47/1.15 Horn 16
% 0.47/1.15 unary 16
% 0.47/1.15 binary 0
% 0.47/1.15 lits 16
% 0.47/1.15 lits eq 16
% 0.47/1.15 fd_pure 0
% 0.47/1.15 fd_pseudo 0
% 0.47/1.15 fd_cond 0
% 0.47/1.15 fd_pseudo_cond 0
% 0.47/1.15 AC symbols 2
% 0.47/1.15
% 0.47/1.15 ------ Input Options Time Limit: Unbounded
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 ------
% 0.47/1.15 Current options:
% 0.47/1.15 ------
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 ------ Proving...
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.15
% 0.47/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.15
% 0.47/1.15
%------------------------------------------------------------------------------