TSTP Solution File: SWC047-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC047-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 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 : 300s
% WCLimit : 300s
% DateTime : Tue Apr 30 20:44:18 EDT 2024
% Result : Unsatisfiable 0.20s 0.36s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC047-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Apr 30 00:24:17 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.36 % Drodi V3.6.0
% 0.20/0.36 % Refutation found
% 0.20/0.36 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.20/0.36 % SZS output start CNFRefutation for theBenchmark
% 0.20/0.36 fof(f8,axiom,(
% 0.20/0.36 ssList(nil) ),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f58,axiom,(
% 0.20/0.36 (![U]: (( ~ ssList(U)| rearsegP(U,nil) ) ))),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f59,axiom,(
% 0.20/0.36 (![U]: (( ~ ssList(U)| rearsegP(U,U) ) ))),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f82,axiom,(
% 0.20/0.36 (![U]: (( ~ rearsegP(nil,U)| ~ ssList(U)| nil = U ) ))),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f100,axiom,(
% 0.20/0.36 (![U,V]: (( ~ ssList(U)| ~ ssList(V)| neq(V,U)| V = U ) ))),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f115,axiom,(
% 0.20/0.36 (![U,V]: (( U != V| ~ neq(U,V)| ~ ssList(V)| ~ ssList(U) ) ))),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f186,negated_conjecture,(
% 0.20/0.36 ssList(sk1) ),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f190,negated_conjecture,(
% 0.20/0.36 sk2 = sk4 ),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f191,negated_conjecture,(
% 0.20/0.36 sk1 = sk3 ),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f192,negated_conjecture,(
% 0.20/0.36 sk4 = sk3 ),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f194,negated_conjecture,(
% 0.20/0.36 (![A]: (( nil = sk2| ~ ssList(A)| ~ neq(A,nil)| ~ rearsegP(sk2,A)| ~ rearsegP(sk1,A) ) ))),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f195,negated_conjecture,(
% 0.20/0.36 ( nil != sk1| neq(sk2,nil) ) ),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f204,plain,(
% 0.20/0.36 ssList(nil)),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f8])).
% 0.20/0.36 fof(f254,plain,(
% 0.20/0.36 ![X0]: (~ssList(X0)|rearsegP(X0,nil))),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f58])).
% 0.20/0.36 fof(f255,plain,(
% 0.20/0.36 ![X0]: (~ssList(X0)|rearsegP(X0,X0))),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f59])).
% 0.20/0.36 fof(f279,plain,(
% 0.20/0.36 ![X0]: (~rearsegP(nil,X0)|~ssList(X0)|nil=X0)),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f82])).
% 0.20/0.36 fof(f299,plain,(
% 0.20/0.36 ![X0,X1]: (~ssList(X0)|~ssList(X1)|neq(X1,X0)|X1=X0)),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f100])).
% 0.20/0.36 fof(f317,plain,(
% 0.20/0.36 ![U]: ((![V]: ((~U=V|~neq(U,V))|~ssList(V)))|~ssList(U))),
% 0.20/0.36 inference(miniscoping,[status(esa)],[f115])).
% 0.20/0.36 fof(f318,plain,(
% 0.20/0.36 ![X0,X1]: (~X0=X1|~neq(X0,X1)|~ssList(X1)|~ssList(X0))),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f317])).
% 0.20/0.36 fof(f427,plain,(
% 0.20/0.36 ssList(sk1)),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f186])).
% 0.20/0.36 fof(f431,plain,(
% 0.20/0.36 sk2=sk4),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f190])).
% 0.20/0.36 fof(f432,plain,(
% 0.20/0.36 sk1=sk3),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f191])).
% 0.20/0.36 fof(f433,plain,(
% 0.20/0.36 sk4=sk3),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f192])).
% 0.20/0.36 fof(f435,plain,(
% 0.20/0.36 ![X0]: (nil=sk2|~ssList(X0)|~neq(X0,nil)|~rearsegP(sk2,X0)|~rearsegP(sk1,X0))),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f194])).
% 0.20/0.36 fof(f436,plain,(
% 0.20/0.36 ~nil=sk1|neq(sk2,nil)),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f195])).
% 0.20/0.36 fof(f445,plain,(
% 0.20/0.36 spl0_2 <=> nil=sk2),
% 0.20/0.36 introduced(split_symbol_definition)).
% 0.20/0.36 fof(f446,plain,(
% 0.20/0.36 nil=sk2|~spl0_2),
% 0.20/0.36 inference(component_clause,[status(thm)],[f445])).
% 0.20/0.36 fof(f448,plain,(
% 0.20/0.36 spl0_3 <=> neq(sk2,nil)),
% 0.20/0.36 introduced(split_symbol_definition)).
% 0.20/0.36 fof(f449,plain,(
% 0.20/0.36 neq(sk2,nil)|~spl0_3),
% 0.20/0.36 inference(component_clause,[status(thm)],[f448])).
% 0.20/0.36 fof(f452,plain,(
% 0.20/0.36 spl0_4 <=> ~ssList(X0)|~neq(X0,nil)|~rearsegP(sk2,X0)|~rearsegP(sk1,X0)),
% 0.20/0.36 introduced(split_symbol_definition)).
% 0.20/0.36 fof(f453,plain,(
% 0.20/0.36 ![X0]: (~ssList(X0)|~neq(X0,nil)|~rearsegP(sk2,X0)|~rearsegP(sk1,X0)|~spl0_4)),
% 0.20/0.36 inference(component_clause,[status(thm)],[f452])).
% 0.20/0.36 fof(f455,plain,(
% 0.20/0.36 spl0_2|spl0_4),
% 0.20/0.36 inference(split_clause,[status(thm)],[f435,f445,f452])).
% 0.20/0.36 fof(f456,plain,(
% 0.20/0.36 spl0_5 <=> nil=sk1),
% 0.20/0.36 introduced(split_symbol_definition)).
% 0.20/0.36 fof(f457,plain,(
% 0.20/0.36 nil=sk1|~spl0_5),
% 0.20/0.36 inference(component_clause,[status(thm)],[f456])).
% 0.20/0.36 fof(f458,plain,(
% 0.20/0.36 ~nil=sk1|spl0_5),
% 0.20/0.36 inference(component_clause,[status(thm)],[f456])).
% 0.20/0.36 fof(f459,plain,(
% 0.20/0.36 ~spl0_5|spl0_3),
% 0.20/0.36 inference(split_clause,[status(thm)],[f436,f456,f448])).
% 0.20/0.36 fof(f468,plain,(
% 0.20/0.36 ![X1]: (~neq(X1,X1)|~ssList(X1)|~ssList(X1))),
% 0.20/0.36 inference(destructive_equality_resolution,[status(esa)],[f318])).
% 0.20/0.36 fof(f469,plain,(
% 0.20/0.36 ![X0]: (~neq(X0,X0)|~ssList(X0))),
% 0.20/0.36 inference(duplicate_literals_removal,[status(esa)],[f468])).
% 0.20/0.36 fof(f492,plain,(
% 0.20/0.36 sk2=sk3),
% 0.20/0.36 inference(forward_demodulation,[status(thm)],[f431,f433])).
% 0.20/0.36 fof(f493,plain,(
% 0.20/0.36 sk2=sk1),
% 0.20/0.36 inference(forward_demodulation,[status(thm)],[f432,f492])).
% 0.20/0.36 fof(f496,plain,(
% 0.20/0.36 spl0_6 <=> ssList(nil)),
% 0.20/0.36 introduced(split_symbol_definition)).
% 0.20/0.36 fof(f498,plain,(
% 0.20/0.36 ~ssList(nil)|spl0_6),
% 0.20/0.36 inference(component_clause,[status(thm)],[f496])).
% 0.20/0.36 fof(f499,plain,(
% 0.20/0.36 spl0_7 <=> nil=nil),
% 0.20/0.36 introduced(split_symbol_definition)).
% 0.20/0.36 fof(f502,plain,(
% 0.20/0.36 ~ssList(nil)|nil=nil|~ssList(nil)),
% 0.20/0.36 inference(resolution,[status(thm)],[f279,f254])).
% 0.20/0.36 fof(f503,plain,(
% 0.20/0.36 ~spl0_6|spl0_7),
% 0.20/0.36 inference(split_clause,[status(thm)],[f502,f496,f499])).
% 0.20/0.36 fof(f506,plain,(
% 0.20/0.36 $false|spl0_6),
% 0.20/0.36 inference(forward_subsumption_resolution,[status(thm)],[f498,f204])).
% 0.20/0.36 fof(f507,plain,(
% 0.20/0.36 spl0_6),
% 0.20/0.36 inference(contradiction_clause,[status(thm)],[f506])).
% 0.20/0.36 fof(f523,plain,(
% 0.20/0.36 nil=sk1|~spl0_2),
% 0.20/0.36 inference(forward_demodulation,[status(thm)],[f493,f446])).
% 0.20/0.36 fof(f524,plain,(
% 0.20/0.36 $false|spl0_5|~spl0_2),
% 0.20/0.36 inference(forward_subsumption_resolution,[status(thm)],[f523,f458])).
% 0.20/0.36 fof(f525,plain,(
% 0.20/0.36 spl0_5|~spl0_2),
% 0.20/0.36 inference(contradiction_clause,[status(thm)],[f524])).
% 0.20/0.36 fof(f526,plain,(
% 0.20/0.36 neq(sk1,nil)|~spl0_3),
% 0.20/0.36 inference(forward_demodulation,[status(thm)],[f493,f449])).
% 0.20/0.36 fof(f527,plain,(
% 0.20/0.36 ![X0]: (~ssList(X0)|~neq(X0,nil)|~rearsegP(sk1,X0)|~rearsegP(sk1,X0)|~spl0_4)),
% 0.20/0.36 inference(forward_demodulation,[status(thm)],[f493,f453])).
% 0.20/0.36 fof(f528,plain,(
% 0.20/0.36 ![X0]: (~ssList(X0)|~neq(X0,nil)|~rearsegP(sk1,X0)|~spl0_4)),
% 0.20/0.36 inference(duplicate_literals_removal,[status(esa)],[f527])).
% 0.20/0.36 fof(f533,plain,(
% 0.20/0.36 neq(nil,nil)|~spl0_5|~spl0_3),
% 0.20/0.36 inference(forward_demodulation,[status(thm)],[f457,f526])).
% 0.20/0.36 fof(f534,plain,(
% 0.20/0.36 ~ssList(nil)|~spl0_5|~spl0_3),
% 0.20/0.36 inference(resolution,[status(thm)],[f533,f469])).
% 0.20/0.36 fof(f535,plain,(
% 0.20/0.36 ~spl0_6|~spl0_5|~spl0_3),
% 0.20/0.36 inference(split_clause,[status(thm)],[f534,f496,f456,f448])).
% 0.20/0.36 fof(f536,plain,(
% 0.20/0.36 spl0_8 <=> ssList(sk1)),
% 0.20/0.36 introduced(split_symbol_definition)).
% 0.20/0.36 fof(f538,plain,(
% 0.20/0.36 ~ssList(sk1)|spl0_8),
% 0.20/0.36 inference(component_clause,[status(thm)],[f536])).
% 0.20/0.36 fof(f544,plain,(
% 0.20/0.36 spl0_10 <=> ~ssList(X0)|~rearsegP(sk1,X0)|~ssList(X0)|X0=nil),
% 0.20/0.36 introduced(split_symbol_definition)).
% 0.20/0.36 fof(f545,plain,(
% 0.20/0.36 ![X0]: (~ssList(X0)|~rearsegP(sk1,X0)|~ssList(X0)|X0=nil|~spl0_10)),
% 0.20/0.36 inference(component_clause,[status(thm)],[f544])).
% 0.20/0.36 fof(f547,plain,(
% 0.20/0.36 ![X0]: (~ssList(X0)|~rearsegP(sk1,X0)|~ssList(nil)|~ssList(X0)|X0=nil|~spl0_4)),
% 0.20/0.36 inference(resolution,[status(thm)],[f528,f299])).
% 0.20/0.36 fof(f548,plain,(
% 0.20/0.36 spl0_10|~spl0_6|~spl0_4),
% 0.20/0.36 inference(split_clause,[status(thm)],[f547,f544,f496,f452])).
% 0.20/0.36 fof(f549,plain,(
% 0.20/0.36 ![X0]: (~ssList(X0)|~rearsegP(sk1,X0)|X0=nil|~spl0_10)),
% 0.20/0.36 inference(duplicate_literals_removal,[status(esa)],[f545])).
% 0.20/0.36 fof(f552,plain,(
% 0.20/0.36 ~ssList(sk1)|sk1=nil|~ssList(sk1)|~spl0_10),
% 0.20/0.36 inference(resolution,[status(thm)],[f549,f255])).
% 0.20/0.36 fof(f553,plain,(
% 0.20/0.36 ~spl0_8|spl0_5|~spl0_10),
% 0.20/0.36 inference(split_clause,[status(thm)],[f552,f536,f456,f544])).
% 0.20/0.36 fof(f559,plain,(
% 0.20/0.36 $false|spl0_8),
% 0.20/0.36 inference(forward_subsumption_resolution,[status(thm)],[f427,f538])).
% 0.20/0.36 fof(f560,plain,(
% 0.20/0.36 spl0_8),
% 0.20/0.36 inference(contradiction_clause,[status(thm)],[f559])).
% 0.20/0.36 fof(f561,plain,(
% 0.20/0.36 $false),
% 0.20/0.36 inference(sat_refutation,[status(thm)],[f455,f459,f503,f507,f525,f535,f548,f553,f560])).
% 0.20/0.36 % SZS output end CNFRefutation for theBenchmark.p
% 0.20/0.37 % Elapsed time: 0.026715 seconds
% 0.20/0.37 % CPU time: 0.039980 seconds
% 0.20/0.37 % Total memory used: 14.282 MB
% 0.20/0.37 % Net memory used: 14.257 MB
%------------------------------------------------------------------------------