%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT080-1 : TPTP v8.1.0. Released v2.6.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 : n011.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 04:48:49 EDT 2022 % Result : Unsatisfiable 0.21s 0.40s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : LAT080-1 : TPTP v8.1.0. Released v2.6.0. % 0.07/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 : n011.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 : Wed Jun 29 20:01:02 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___209_C18_F1_AE_CS_SP_PI_S0Y % 0.14/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.14/0.37 # % 0.14/0.37 # Number of axioms: 2 Number of unprocessed: 2 % 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 # 2 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 2 unit axioms. % 0.14/0.37 # 1 start rule tableaux created. % 0.14/0.37 # 0 extension rule candidate clauses % 0.14/0.37 # 2 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 # Creating equality axioms % 0.14/0.37 # Ran out of tableaux, making start rules for all clauses % 0.14/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.14/0.37 # We now have 9 tableaux to operate on % 0.21/0.40 # There were 1 total branch saturation attempts. % 0.21/0.40 # There were 0 of these attempts blocked. % 0.21/0.40 # There were 0 deferred branch saturation attempts. % 0.21/0.40 # There were 0 free duplicated saturations. % 0.21/0.40 # There were 1 total successful branch saturations. % 0.21/0.40 # There were 0 successful branch saturations in interreduction. % 0.21/0.40 # There were 0 successful branch saturations on the branch. % 0.21/0.40 # There were 1 successful branch saturations after the branch. % 0.21/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.40 # Begin clausification derivation % 0.21/0.40 % 0.21/0.40 # End clausification derivation % 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.40 cnf(i_0_4, negated_conjecture, (meet(a,a)!=a)). % 0.21/0.40 cnf(i_0_3, plain, (join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)),meet(join(meet(X2,meet(meet(join(X4,join(X2,X5)),join(X6,X2)),X2)),meet(X7,join(X2,meet(meet(join(X4,join(X2,X5)),join(X6,X2)),X2)))),join(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3)))=X2)). % 0.21/0.40 cnf(i_0_6, plain, (X8=X8)). % 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.40 # Begin printing tableau % 0.21/0.40 # Found 6 steps % 0.21/0.40 cnf(i_0_3, plain, (join(meet(join(meet(X1,a),meet(a,join(X1,a))),X3),meet(join(meet(X1,join(join(meet(X4,a),meet(a,X5)),a)),meet(join(meet(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)),meet(X7,join(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)))),join(X1,join(join(meet(X4,a),meet(a,X5)),a)))),join(join(meet(X1,a),meet(a,join(X1,a))),X3)))=a), inference(start_rule)). % 0.21/0.40 cnf(i_0_13, plain, (join(meet(join(meet(X1,a),meet(a,join(X1,a))),X3),meet(join(meet(X1,join(join(meet(X4,a),meet(a,X5)),a)),meet(join(meet(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)),meet(X7,join(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)))),join(X1,join(join(meet(X4,a),meet(a,X5)),a)))),join(join(meet(X1,a),meet(a,join(X1,a))),X3)))=a), inference(extension_rule, [i_0_9])). % 0.21/0.40 cnf(i_0_136, plain, (meet(a,a)=a), inference(closure_rule, [i_0_4])). % 0.21/0.40 cnf(i_0_137, plain, (meet(a,a)!=join(meet(join(meet(X1,a),meet(a,join(X1,a))),X3),meet(join(meet(X1,join(join(meet(X4,a),meet(a,X5)),a)),meet(join(meet(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)),meet(X7,join(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)))),join(X1,join(join(meet(X4,a),meet(a,X5)),a)))),join(join(meet(X1,a),meet(a,join(X1,a))),X3)))), inference(extension_rule, [i_0_9])). % 0.21/0.40 cnf(i_0_150, plain, (meet(a,a)!=join(meet(join(meet(X1,meet(a,a)),meet(meet(a,a),join(X1,meet(a,a)))),X3),meet(join(meet(X1,join(join(meet(X4,meet(a,a)),meet(meet(a,a),X5)),meet(a,a))),meet(join(meet(meet(a,a),meet(meet(join(X4,join(meet(a,a),X5)),join(X6,meet(a,a))),meet(a,a))),meet(X7,join(meet(a,a),meet(meet(join(X4,join(meet(a,a),X5)),join(X6,meet(a,a))),meet(a,a))))),join(X1,join(join(meet(X4,meet(a,a)),meet(meet(a,a),X5)),meet(a,a))))),join(join(meet(X1,meet(a,a)),meet(meet(a,a),join(X1,meet(a,a)))),X3)))), inference(closure_rule, [i_0_3])). % 0.21/0.40 cnf(i_0_151, plain, (join(meet(join(meet(X1,meet(a,a)),meet(meet(a,a),join(X1,meet(a,a)))),X3),meet(join(meet(X1,join(join(meet(X4,meet(a,a)),meet(meet(a,a),X5)),meet(a,a))),meet(join(meet(meet(a,a),meet(meet(join(X4,join(meet(a,a),X5)),join(X6,meet(a,a))),meet(a,a))),meet(X7,join(meet(a,a),meet(meet(join(X4,join(meet(a,a),X5)),join(X6,meet(a,a))),meet(a,a))))),join(X1,join(join(meet(X4,meet(a,a)),meet(meet(a,a),X5)),meet(a,a))))),join(join(meet(X1,meet(a,a)),meet(meet(a,a),join(X1,meet(a,a)))),X3)))!=join(meet(join(meet(X1,a),meet(a,join(X1,a))),X3),meet(join(meet(X1,join(join(meet(X4,a),meet(a,X5)),a)),meet(join(meet(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)),meet(X7,join(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)))),join(X1,join(join(meet(X4,a),meet(a,X5)),a)))),join(join(meet(X1,a),meet(a,join(X1,a))),X3)))), inference(etableau_closure_rule, [i_0_151, ...])). % 0.21/0.40 # End printing tableau % 0.21/0.40 # SZS output end % 0.21/0.40 # Branches closed with saturation will be marked with an "s" % 0.21/0.40 # Child (7199) has found a proof. % 0.21/0.40 % 0.21/0.40 # Proof search is over... % 0.21/0.40 # Freeing feature tree %------------------------------------------------------------------------------