TSTP Solution File: KRS001-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS001-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n018.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 03:00:18 EDT 2022
% Result : Unsatisfiable 0.14s 0.37s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS001-1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n018.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 : 600
% 0.14/0.34 % DateTime : Tue Jun 7 15:51:51 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 16 Number of unprocessed: 16
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.14/0.37 # The folding up rule is enabled...
% 0.14/0.37 # Local unification is enabled...
% 0.14/0.37 # Any saturation attempts will use folding labels...
% 0.14/0.37 # 16 beginning clauses after preprocessing and clausification
% 0.14/0.37 # Creating start rules for all 1 conjectures.
% 0.14/0.37 # There are 1 start rule candidates:
% 0.14/0.37 # Found 1 unit axioms.
% 0.14/0.37 # 1 start rule tableaux created.
% 0.14/0.37 # 15 extension rule candidate clauses
% 0.14/0.37 # 1 unit axiom clauses
% 0.14/0.37
% 0.14/0.37 # Requested 8, 32 cores available to the main process.
% 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.37 # There were 1 total branch saturation attempts.
% 0.14/0.37 # There were 0 of these attempts blocked.
% 0.14/0.37 # There were 0 deferred branch saturation attempts.
% 0.14/0.37 # There were 0 free duplicated saturations.
% 0.14/0.37 # There were 1 total successful branch saturations.
% 0.14/0.37 # There were 0 successful branch saturations in interreduction.
% 0.14/0.37 # There were 0 successful branch saturations on the branch.
% 0.14/0.37 # There were 1 successful branch saturations after the branch.
% 0.14/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 # Begin clausification derivation
% 0.14/0.37
% 0.14/0.37 # End clausification derivation
% 0.14/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.37 cnf(i_0_17, negated_conjecture, (e(exist))).
% 0.14/0.37 cnf(i_0_31, plain, (c(X1)|~e(X1))).
% 0.14/0.37 cnf(i_0_30, plain, (d(X1)|~e(X1))).
% 0.14/0.37 cnf(i_0_18, plain, (r2least(X1)|~c(X1))).
% 0.14/0.37 cnf(i_0_24, plain, (r1most(X1)|~d(X1))).
% 0.14/0.37 cnf(i_0_19, plain, (c(X1)|~r2least(X1))).
% 0.14/0.37 cnf(i_0_25, plain, (d(X1)|~r1most(X1))).
% 0.14/0.37 cnf(i_0_32, plain, (e(X1)|~d(X1)|~c(X1))).
% 0.14/0.37 cnf(i_0_20, plain, (~equalish(u1r2(X1),u1r1(X1))|~r2least(X1))).
% 0.14/0.37 cnf(i_0_27, plain, (r1most(X1)|~equalish(u3r2(X1),u3r1(X1)))).
% 0.14/0.37 cnf(i_0_22, plain, (r(X1,u1r2(X1))|~r2least(X1))).
% 0.14/0.37 cnf(i_0_29, plain, (r1most(X1)|r(X1,u3r2(X1)))).
% 0.14/0.37 cnf(i_0_21, plain, (r(X1,u1r1(X1))|~r2least(X1))).
% 0.14/0.37 cnf(i_0_28, plain, (r1most(X1)|r(X1,u3r1(X1)))).
% 0.14/0.37 cnf(i_0_26, plain, (equalish(X1,X2)|~r1most(X3)|~r(X3,X2)|~r(X3,X1))).
% 0.14/0.37 cnf(i_0_23, plain, (equalish(X1,X2)|r2least(X3)|~r(X3,X2)|~r(X3,X1))).
% 0.14/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.37 # Begin printing tableau
% 0.14/0.37 # Found 4 steps
% 0.14/0.37 cnf(i_0_17, negated_conjecture, (e(exist)), inference(start_rule)).
% 0.14/0.37 cnf(i_0_33, plain, (e(exist)), inference(extension_rule, [i_0_30])).
% 0.14/0.37 cnf(i_0_36, plain, (d(exist)), inference(extension_rule, [i_0_24])).
% 0.14/0.37 cnf(i_0_75, plain, (r1most(exist)), inference(etableau_closure_rule, [i_0_75, ...])).
% 0.14/0.37 # End printing tableau
% 0.14/0.37 # SZS output end
% 0.14/0.37 # Branches closed with saturation will be marked with an "s"
% 0.14/0.37 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.37 # We now have 2 tableaux to operate on
% 0.14/0.37 # Found closed tableau during pool population.
% 0.14/0.37 # Proof search is over...
% 0.14/0.37 # Freeing feature tree
%------------------------------------------------------------------------------