TSTP Solution File: LCL433-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL433-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:24:52 EDT 2023
% Result : Timeout 408.31s 300.10s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 8 unt; 0 nHn; 18 RR)
% Number of literals : 41 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 53 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PropLog_Othms_OMP_0,axiom,
( c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.gmsoATMcIE/E---3.1_28011.p',cls_PropLog_Othms_OMP_0) ).
cnf(cls_PropLog_Oweaken__left__insert_0,axiom,
( c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.gmsoATMcIE/E---3.1_28011.p',cls_PropLog_Oweaken__left__insert_0) ).
cnf(cls_PropLog_Othms_OH_0,axiom,
( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.gmsoATMcIE/E---3.1_28011.p',cls_PropLog_Othms_OH_0) ).
cnf(cls_conjecture_4,negated_conjecture,
( c_in(X1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(v_F,X1,t_a) ),
file('/export/starexec/sandbox2/tmp/tmp.gmsoATMcIE/E---3.1_28011.p',cls_conjecture_4) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox2/tmp/tmp.gmsoATMcIE/E---3.1_28011.p',cls_Set_OinsertCI_1) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/tmp/tmp.gmsoATMcIE/E---3.1_28011.p',cls_conjecture_3) ).
cnf(cls_PropLog_Osat__imp_0,axiom,
( c_PropLog_Osat(X2,c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3)
| ~ c_PropLog_Osat(c_insert(X1,X2,tc_PropLog_Opl(X3)),X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.gmsoATMcIE/E---3.1_28011.p',cls_PropLog_Osat__imp_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
file('/export/starexec/sandbox2/tmp/tmp.gmsoATMcIE/E---3.1_28011.p',cls_conjecture_2) ).
cnf(c_0_8,axiom,
( c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
cls_PropLog_Othms_OMP_0 ).
cnf(c_0_9,axiom,
( c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
cls_PropLog_Oweaken__left__insert_0 ).
cnf(c_0_10,plain,
( c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(X5,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X5,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
cls_PropLog_Othms_OH_0 ).
cnf(c_0_12,plain,
( c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X5,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
| ~ c_in(X5,c_insert(X2,X3,tc_PropLog_Opl(X4)),tc_PropLog_Opl(X4)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
( c_in(X1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(v_F,X1,t_a) ),
cls_conjecture_4 ).
cnf(c_0_14,negated_conjecture,
( c_in(X1,c_PropLog_Othms(c_insert(X2,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_in(X3,c_insert(X2,v_F,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(X3,X1,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_16,negated_conjecture,
~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_3 ).
cnf(c_0_17,negated_conjecture,
( c_in(X1,c_PropLog_Othms(c_insert(X2,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(X2,X1,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
~ c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),t_a),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
( c_PropLog_Osat(X2,c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3)
| ~ c_PropLog_Osat(c_insert(X1,X2,tc_PropLog_Opl(X3)),X4,X3) ),
cls_PropLog_Osat__imp_0 ).
cnf(c_0_20,negated_conjecture,
c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
cls_conjecture_2 ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL433-2 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 12:33:46 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.51 Running first-order model finding
% 0.21/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.gmsoATMcIE/E---3.1_28011.p
% 408.31/300.10 # Version: 3.1pre001
% 408.31/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.31/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.31/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.31/300.10 # Starting new_bool_3 with 300s (1) cores
% 408.31/300.10 # Starting new_bool_1 with 300s (1) cores
% 408.31/300.10 # Starting sh5l with 300s (1) cores
% 408.31/300.10 # new_bool_3 with pid 28096 completed with status 0
% 408.31/300.10 # Result found by new_bool_3
% 408.31/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.31/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.31/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.31/300.10 # Starting new_bool_3 with 300s (1) cores
% 408.31/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.31/300.10 # Search class: FHUNF-FFSF32-MFFFFFNN
% 408.31/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.31/300.10 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.31/300.10 # SAT001_MinMin_p005000_rr_RG with pid 28102 completed with status 0
% 408.31/300.10 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.31/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.31/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.31/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.31/300.10 # Starting new_bool_3 with 300s (1) cores
% 408.31/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.31/300.10 # Search class: FHUNF-FFSF32-MFFFFFNN
% 408.31/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.31/300.10 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.31/300.10 # Preprocessing time : 0.001 s
% 408.31/300.10 # Presaturation interreduction done
% 408.31/300.10
% 408.31/300.10 # Proof found!
% 408.31/300.10 # SZS status Unsatisfiable
% 408.31/300.10 # SZS output start CNFRefutation
% See solution above
% 408.31/300.10 # Parsed axioms : 8
% 408.31/300.10 # Removed by relevancy pruning/SinE : 0
% 408.31/300.10 # Initial clauses : 8
% 408.31/300.10 # Removed in clause preprocessing : 0
% 408.31/300.10 # Initial clauses in saturation : 8
% 408.31/300.10 # Processed clauses : 67
% 408.31/300.10 # ...of these trivial : 0
% 408.31/300.10 # ...subsumed : 3
% 408.31/300.10 # ...remaining for further processing : 64
% 408.31/300.10 # Other redundant clauses eliminated : 0
% 408.31/300.10 # Clauses deleted for lack of memory : 0
% 408.31/300.10 # Backward-subsumed : 0
% 408.31/300.10 # Backward-rewritten : 0
% 408.31/300.10 # Generated clauses : 139
% 408.31/300.10 # ...of the previous two non-redundant : 138
% 408.31/300.10 # ...aggressively subsumed : 0
% 408.31/300.10 # Contextual simplify-reflections : 0
% 408.31/300.10 # Paramodulations : 139
% 408.31/300.10 # Factorizations : 0
% 408.31/300.10 # NegExts : 0
% 408.31/300.10 # Equation resolutions : 0
% 408.31/300.10 # Total rewrite steps : 1
% 408.31/300.10 # Propositional unsat checks : 0
% 408.31/300.10 # Propositional check models : 0
% 408.31/300.10 # Propositional check unsatisfiable : 0
% 408.31/300.10 # Propositional clauses : 0
% 408.31/300.10 # Propositional clauses after purity: 0
% 408.31/300.10 # Propositional unsat core size : 0
% 408.31/300.10 # Propositional preprocessing time : 0.000
% 408.31/300.10 # Propositional encoding time : 0.000
% 408.31/300.10 # Propositional solver time : 0.000
% 408.31/300.10 # Success case prop preproc time : 0.000
% 408.31/300.10 # Success case prop encoding time : 0.000
% 408.31/300.10 # Success case prop solver time : 0.000
% 408.31/300.10 # Current number of processed clauses : 56
% 408.31/300.10 # Positive orientable unit clauses : 2
% 408.31/300.10 # Positive unorientable unit clauses: 0
% 408.31/300.10 # Negative unit clauses : 10
% 408.31/300.10 # Non-unit-clauses : 44
% 408.31/300.10 # Current number of unprocessed clauses: 87
% 408.31/300.10 # ...number of literals in the above : 281
% 408.31/300.10 # Current number of archived formulas : 0
% 408.31/300.10 # Current number of archived clauses : 8
% 408.31/300.10 # Clause-clause subsumption calls (NU) : 464
% 408.31/300.10 # Rec. Clause-clause subsumption calls : 456
% 408.31/300.10 # Non-unit clause-clause subsumptions : 2
% 408.31/300.10 # Unit Clause-clause subsumption calls : 75
% 408.31/300.10 # Rewrite failures with RHS unbound : 0
% 408.31/300.10 # BW rewrite match attempts : 0
% 408.31/300.10 # BW rewrite match successes : 0
% 408.31/300.10 # Condensation attempts : 0
% 408.31/300.10 # Condensation successes : 0
% 408.31/300.10 # Termbank termtop insertions : 4483
% 408.31/300.10
% 408.31/300.10 # -------------------------------------------------
% 408.31/300.10 # User time : 0.007 s
% 408.31/300.10 # System time : 0.002 s
% 408.31/300.10 # Total time : 0.009 s
% 408.31/300.10 # Maximum resident set size: 1692 pages
% 408.31/300.10
% 408.31/300.10 # -------------------------------------------------
% 408.31/300.10 # User time : 0.009 s
% 408.31/300.10 # System time : 0.004 s
% 408.31/300.10 # Total time : 0.012 s
% 408.31/300.10 # Maximum resident set size: 1680 pages
% 408.31/300.10 % E---3.1 exiting
%------------------------------------------------------------------------------