%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SWV242-2 : TPTP v9.2.1. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n019.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 : Thu May 7 07:36:56 PM UTC 2026
% Result : Unsatisfiable 0.39s 0.60s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV242-2 : TPTP v9.2.1. Released v3.2.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n019.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu May 7 13:27:15 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 SPASS-SCL-FOL version:
% 0.19/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.39/0.60 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.60 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.60 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.60 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.60 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.60 Execution resolution_3 ended with status: unsatisfiable
% 0.39/0.60 Used heuristic: resolution_3
% 0.39/0.60
% 0.39/0.60 Input Clauses:
% 0.39/0.60
% 0.39/0.60 Predicates: c_lessequals
% 0.39/0.60 Fol Constants: v_G v_G_H tc_Message_Omsg v_H v_H_H
% 0.39/0.60 Fol Functions: c_Message_Oanalz tc_set c_union
% 0.39/0.60 Problem Properties:
% 0.39/0.60 This is a full first-order problem without equality.
% 0.39/0.60
% 0.39/0.60 After reduction: Problem Properties:
% 0.39/0.60 This is a full first-order problem without equality.
% 0.39/0.60
% 0.39/0.60
% 0.39/0.60 Reduced Input Clauses:
% 0.39/0.60
% 0.39/0.60 Most General Atoms: c_lessequals(x3,x1,tc_set(x2))
% 0.39/0.60
% 0.39/0.60 === Starting SPASS-SCL-FOL A Little Less Naive, considering 13 atoms initially, heuristics mode: resolution_3 ===
% 0.39/0.60
% 0.39/0.60 === Backtracking. Learning clause 8:2:1:[7.1,2.1]:Top: c_lessequals(x0,v_H,tc_set(tc_Message_Omsg)) -> c_lessequals(x0,c_Message_Oanalz(v_H_H),tc_set(tc_Message_Omsg))
% 0.39/0.60 === Backtracking. Learning clause 9:3:1:[3.1,7.3]:Top: c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),c_lessequals(x0,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),c_lessequals(v_H,x0,tc_set(tc_Message_Omsg)) ->
% 0.39/0.60 === Clause set with instances from active satisfied. Growing active. New size: 16
% 0.39/0.60 === Restarting.
% 0.39/0.60 === Backtracking. Learning clause 10:4:2:[7.1,4.2,7.1,9.1]:TopTop: c_lessequals(x0,c_Message_Oanalz(x1),tc_set(tc_Message_Omsg)),c_lessequals(x1,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),c_lessequals(v_G,x0,tc_set(tc_Message_Omsg)),c_lessequals(v_H,v_G,tc_set(tc_Message_Omsg)) ->
% 0.39/0.60 === Clause set with instances from active satisfied. Growing active. New size: 18
% 0.39/0.60 === Restarting.
% 0.39/0.60 === Conflict found: 10:4:2:[7.1,4.2,7.1,9.1]:TopTop: c_lessequals(x0,c_Message_Oanalz(x1),tc_set(tc_Message_Omsg)),c_lessequals(x1,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),c_lessequals(v_G,x0,tc_set(tc_Message_Omsg)),c_lessequals(v_H,v_G,tc_set(tc_Message_Omsg)) -> {x0 -> v_G, x1 -> v_G_H}
% 0.39/0.60 === Backtracking. Learning clause 11:2:0:[10.2,5.1,1.1]:: c_lessequals(v_G,v_G,tc_set(tc_Message_Omsg)),c_lessequals(v_H,v_G,tc_set(tc_Message_Omsg)) ->
% 0.39/0.60 === Conflict found: 9:3:1:[3.1,7.3]:Top: c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),c_lessequals(x0,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),c_lessequals(v_H,x0,tc_set(tc_Message_Omsg)) -> {x0 -> c_Message_Oanalz(v_G)}
% 0.39/0.60 === Backtracking. Learning clause 12:3:1:[9.2,4.2]:Top: c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),c_lessequals(v_H,c_Message_Oanalz(x0),tc_set(tc_Message_Omsg)),c_lessequals(x0,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)) ->
% 0.39/0.60 === Backtracking. Learning clause 13:5:3:[7.1,4.2,7.1,12.1]:TopTopTop: c_lessequals(x0,c_Message_Oanalz(x1),tc_set(tc_Message_Omsg)),c_lessequals(x1,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),c_lessequals(v_G,x0,tc_set(tc_Message_Omsg)),c_lessequals(v_H,c_Message_Oanalz(x2),tc_set(tc_Message_Omsg)),c_lessequals(x2,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)) ->
% 0.39/0.60 === Conflict found: 13:5:3:[7.1,4.2,7.1,12.1]:TopTopTop: c_lessequals(x0,c_Message_Oanalz(x1),tc_set(tc_Message_Omsg)),c_lessequals(x1,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),c_lessequals(v_G,x0,tc_set(tc_Message_Omsg)),c_lessequals(v_H,c_Message_Oanalz(x2),tc_set(tc_Message_Omsg)),c_lessequals(x2,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)) -> {x0 -> v_G, x1 -> v_G_H, x2 -> v_H_H}
% 0.39/0.60 === Backtracking. Learning clause 14:1:0:[13.5,6.1,5.1,2.1,1.1]:: c_lessequals(v_G,v_G,tc_set(tc_Message_Omsg)) ->
% 0.39/0.60 === Conflict found: 13:5:3:[7.1,4.2,7.1,12.1]:TopTopTop: c_lessequals(x0,c_Message_Oanalz(x1),tc_set(tc_Message_Omsg)),c_lessequals(x1,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),c_lessequals(v_G,x0,tc_set(tc_Message_Omsg)),c_lessequals(v_H,c_Message_Oanalz(x2),tc_set(tc_Message_Omsg)),c_lessequals(x2,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)) -> {x0 -> v_H, x1 -> v_H_H, x2 -> v_H_H}
% 0.39/0.60 === Backtracking. Learning clause 15:1:0:[13.2,6.1,2.1]:: c_lessequals(v_G,v_H,tc_set(tc_Message_Omsg)) ->
% 0.39/0.60 === Clause set with instances from active satisfied. Growing active. New size: 19
% 0.39/0.60 === Restarting.
% 0.39/0.60 === Clause set with instances from active satisfied. Growing active. New size: 71
% 0.39/0.60 === Backtracking. Learning clause 16:1:0:[7.1,4.2,9.1,5.1,1.1]:: c_lessequals(v_H,v_G,tc_set(tc_Message_Omsg)) ->
% 0.39/0.60 === Conflict found: 12:3:1:[9.2,4.2]:Top: c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),c_lessequals(v_H,c_Message_Oanalz(x0),tc_set(tc_Message_Omsg)),c_lessequals(x0,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)) -> {x0 -> v_H_H}
% 0.39/0.60 === Backtracking. Learning clause 17:1:0:[12.3,6.1,2.1]:: c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ->
% 0.39/0.60
% 0.39/0.60 SZS status Unsatisfiable
% 0.39/0.60
% 0.39/0.60 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.60
% 0.39/0.60 SPASS-SCL-FOL Statistics:
% 0.39/0.60 Number of learned clauses: 10
% 0.39/0.60 Number of propagations: 120
% 0.39/0.60 Number of decisions: 49
% 0.39/0.60 Number of resolutions: 27
% 0.39/0.60 Number of condensations: 0
% 0.39/0.60 Number of sub resolutions: 0
% 0.39/0.60 Number of input literals (deduplicated): 9
% 0.39/0.60 Number of grows: 4
% 0.39/0.60 Number of considered ground atoms: 71
% 0.39/0.60
% 0.39/0.60 Needed: 0:00:00.01
% 0.39/0.60
%------------------------------------------------------------------------------